English

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

Logic 2020-12-01 v1

Abstract

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 (R,<)(\mathbb{R},<) have the property, as do all expansions of (R,+,,N)(\mathbb{R},+,\cdot,\mathbb{N}). Our main analytic-geometric result is that any such expansion of (R,<,+)(\mathbb{R},<,+) by boolean combinations of open sets (of any arities) either is o\nobreakdash-\hspace{0pt}minimal or defines an isomorph of (N,+,)(\mathbb N,+,\cdot\,). We also show that any given expansion of (R,<,+,N)(\mathbb{R}, <, +,\mathbb{N}) by subsets of Nn\mathbb{N}^n (nn 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.

Keywords

Cite

@article{arxiv.2011.14833,
  title  = {Connectedness in structures on the real numbers: o-minimality and undecidability},
  author = {Alfred Dolich and Chris Miller and Alex Savatovsky and Athipat Thamrongthanyalak},
  journal= {arXiv preprint arXiv:2011.14833},
  year   = {2020}
}
R2 v1 2026-06-23T20:36:04.763Z