Definably complete structures are not pseudo-enumerable

DOI10.1007/s00153-011-0235-xzbMath1220.03029OpenAlexW1973819769MaRDI 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 structuresdefinably complete structurespseudo-enumerable sets

Mathematics Subject Classification ID

Baire category, Baire spaces (54E52) Model theory of ordered structures; o-minimality (03C64) Ordered fields (12J15)

Related Items (4)

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

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

This page was built for publication: Definably complete structures are not pseudo-enumerable