
TL;DR
This paper constructs a special Cantor set within the real numbers that ensures all definable sets are Borel, and proves model-theoretic properties like quantifier-elimination, making it the first tame Cantor set with such features.
Contribution
It introduces the first example of a model-theoretically tame Cantor set with quantifier-elimination and completeness in the structure $( eal, <, +, imes, K)$.
Findings
All definable sets in the structure are Borel.
The structure admits quantifier-elimination and is complete.
This is the first example of a tame Cantor set with these properties.
Abstract
A Cantor set is a non-empty, compact set that has neither interior nor isolated points. In this paper a Cantor set is constructed such that every set definable in is Borel. In addition, we prove quantifier-elimination and completeness results for , making the set the first example of a modeltheoretically tame Cantor set. This answers questions raised by Friedman, Kurdyka, Miller and Speissegger. The work in this paper depends crucially on results about automata on infinite words, in particular B\"uchi's celebrated theorem on the monadic second-order theory of one successor and McNaughton's theorem on Muller automata, which had never been used in the setting of expansions of the real field.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals
