Alex Savatovsky

dblp:273/8526 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 1 since 2021
YearPublicationVenuePosition
2022 Connectedness in Structures on the Real numbers: O-Minimality and Undecidability
abstract
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.
Alfred Dolich, Christopher Lee Miller, Alex Savatovsky, Athipat Thamrongthanyalak
J. Symb. Log.3
2020 Expansions of real closed fields that introduce no new smooth functions
Pantelis E. Eleftheriou, Alex Savatovsky
Ann. Pure Appl. Log.2