Connectedness in Structures on the Real Numbers: O-Minimality and Undecidability

Journal of Symbolic Logic 87 (3):1243-1259 (2022)
  Copy   BIBTEX

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-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-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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Dp-Minimality: Basic Facts and Examples.Alfred Dolich, John Goodrick & David Lippel - 2011 - Notre Dame Journal of Formal Logic 52 (3):267-288.
A version of p-adic minimality.Raf Cluckers & Eva Leenknegt - 2012 - Journal of Symbolic Logic 77 (2):621-630.
On ℵ0‐categorical weakly circularly minimal structures.Beibut Sh Kulpeshov - 2006 - Mathematical Logic Quarterly 52 (6):555-574.
The abstract type of the real numbers.Fernando Ferreira - 2021 - Archive for Mathematical Logic 60 (7):1005-1017.
What is o-minimality?Harvey M. Friedman - 2008 - Annals of Pure and Applied Logic 156 (1):59-67.
A Real Number Structure that is Effectively Categorical.Peter Hertling - 1999 - Mathematical Logic Quarterly 45 (2):147-182.
B-minimality.Raf Cluckers & François Loeser - 2007 - Journal of Mathematical Logic 7 (2):195-227.
Order‐free Recursion on the Real Numbers.Vasco Brattka - 1997 - Mathematical Logic Quarterly 43 (2):216-234.

Analytics

Added to PP
2022-04-08

Downloads
13 (#973,701)

6 months
3 (#880,460)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Chris Miller
Oxford University

Citations of this work

No citations found.

Add more citations

References found in this work

Definability and decision problems in arithmetic.Julia Robinson - 1949 - Journal of Symbolic Logic 14 (2):98-114.
Expansions of o-Minimal Structures by Iteration Sequences.Chris Miller & James Tyne - 2006 - Notre Dame Journal of Formal Logic 47 (1):93-99.
Expansions of o-minimal structures by fast sequences.Harvey Friedman & Chris Miller - 2005 - Journal of Symbolic Logic 70 (2):410-418.
Definably connected nonconnected sets.Antongiulio Fornasiero - 2012 - Mathematical Logic Quarterly 58 (1):125-126.

Add more references