arXiv Analytics

Sign in

arXiv:2011.14833 [math.LO]AbstractReferencesReviewsResources

Connectedness in structures on the real numbers: o-minimality and undecidability

Alfred Dolich, Chris Miller, Alex Savatovsky, Athipat Thamrongthanyalak

Published 2020-11-30Version 1

We initiate an investigation of structures on the set of real numbers having the property that path components of definable sets are definable. All o\nobreakdash-\hspace{0pt}minimal structures on $(\mathbb{R},<)$ have the property, as do all expansions of $(\mathbb{R},+,\cdot,\mathbb{N})$. Our main analytic-geometric result is that any such expansion of $(\mathbb{R},<,+)$ by boolean combinations of open sets (of any arities) either is o\nobreakdash-\hspace{0pt}minimal or defines an isomorph of $(\mathbb N,+,\cdot\,)$. We also show that any given expansion of $(\mathbb{R}, <, +,\mathbb{N})$ by subsets of $\mathbb{N}^n$ ($n$ allowed to vary) has the property if and only if it defines all arithmetic sets. Variations arise by considering connected components or quasicomponents instead of path components.

Related articles: Most relevant | Search more
arXiv:math/0509658 [math.LO] (Published 2005-09-28)
A question of van den Dries and a theorem of Lipshitz and Robinson: Not everything is standard
arXiv:2206.12721 [math.LO] (Published 2022-06-25)
On the computational properties of the uncountability of the real numbers
arXiv:1203.2715 [math.LO] (Published 2012-03-13, updated 2012-03-29)
The Non-Axiomatizability of O-Minimality