Definably complete Baire structures

2010/01/01 by Antongiulio Fornasiero, Tamara Servi · 2 citations
Mathematics · Computer Science · #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms

paper · pdf · doi:10.4064/fm209-3-2

Abstract

We consider definably complete Baire expansions of ordered fields: every definable subset of the domain of the structure has a supremum and the domain cannot be written as the union of a definable increasing family of nowhere dense sets. Every expansion o

Cited by

• Dimension and topology in transserial tame pairs
• Extending orders to types

Related

• Definably complete and Baire structures and Pfaffian closure
• Tame structures and open cores
• NIP formulas and Baire 1 definability
• Definable quotients in d-minimal structures
• On Σ¹₁-complete Equivalence Relations on the Generalized Baire Space