Definably complete structures are not pseudo-enumerable

DOI10.1007/s00153-011-0235-xzbMath1220.03029MaRDI QIDQ634773

Antongiulio Fornasiero

Publication date: 16 August 2011

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-011-0235-x

zbMATH Keywords

Baire structures; definably complete structures; pseudo-enumerable sets

Mathematics Subject Classification ID

54E52: Baire category, Baire spaces

03C64: Model theory of ordered structures; o-minimality

12J15: Ordered fields

Related Items

An analogue of the Baire category theorem, Definably complete structures are not pseudo-enumerable, A FUNDAMENTAL DICHOTOMY FOR DEFINABLY COMPLETE EXPANSIONS OF ORDERED FIELDS, A Note on Hieronymi’s Theorem: Every Definably Complete Structure Is Definably Baire

Cites Work

• Unnamed Item
• Definably complete structures are not pseudo-enumerable
• Dimensions, matroids, and dense pairs of first-order structures
• Locally o-minimal structures and structures with locally o-minimal open core
• Definably complete Baire structures
• Definable versions of theorems by Kirszbraun and Helly
• Defining the set of integers in expansions of the real field by a closed discrete set
• Expansions of dense linear orders with the intermediate value property
• An analogue of the Baire category theorem
• A first-order version of Pfaffian closure