Skip to main content
Log in

Definably complete structures are not pseudo-enumerable

  • Original Article
  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

We prove that a definably complete expansion of a field cannot be the image of a definable discrete set under a definable function.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Aschenbrenner, M., Fischer, A.: Definable versions of theorems by Kirszbraun and Helly. In: Proceedings of London Mathematical Society (2010, to appear)

  2. Fornasiero, A.: Locally o-minimal structures and structures with locally o-minimal open core, submitted (2010)

  3. Fornasiero, A.: D-minimal structures, v.0.8, submitted (2011)

  4. Fornasiero, A.: Dimensions, matroids, and dense pairs of first-order structures. In: APAL (2011, to appear)

  5. Fratarcangeli S.: A first-order version of Pfaffian closure. Fund. Math. 198, 229–254 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Fornasiero A., Servi T.: Definably complete Baire structures. Fund. Math. 209(3), 215–241 (2010) MR 2720211

    Article  MathSciNet  MATH  Google Scholar 

  7. Hieronymi P.: Defining the set of integers in expansions of the real field by a closed discrete set. Proc. Amer. Math. Soc. 138(6), 2163–2168 (2010) MR 2596055

    Article  MathSciNet  MATH  Google Scholar 

  8. Hieronymi, P.: An analogue of the Baire category theorem, Preprint at http://arxiv.org/abs/1101.1194, March 2011

  9. Miller C.: Expansions of dense linear orders with the intermediate value property. J. Symb. Log. 66(4), 1783–1790 (2001) MR MR1877021 (2003j:03044)

    Article  MATH  Google Scholar 

  10. Miller, C.: Tameness in expansions of the real field. Logic Colloquium ’01, Lect Notes Log., vol. 20, Assoc. Symbol. Logic, Urbana, IL, 2005, pp. 281–316. MR MR2143901 (2006j:03049)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Antongiulio Fornasiero.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fornasiero, A. Definably complete structures are not pseudo-enumerable. Arch. Math. Logic 50, 603–615 (2011). https://doi.org/10.1007/s00153-011-0235-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-011-0235-x

Keywords

Mathematics Subject Classification (2000)

Navigation