Definably complete structures are not pseudo-enumerable

Archive for Mathematical Logic 50 (5-6):603-615 (2011)
  Copy   BIBTEX

Abstract

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

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-10-27

Downloads
147 (#291,547)

6 months
6 (#1,502,802)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Dimensions, matroids, and dense pairs of first-order structures.Antongiulio Fornasiero - 2011 - Annals of Pure and Applied Logic 162 (7):514-543.

Add more references