Pseudofinite and Pseudocompact Metric Structures

Notre Dame Journal of Formal Logic 56 (3):493-510 (2015)
  Copy   BIBTEX

Abstract

The definition of a pseudofinite structure can be translated verbatim into continuous logic, but it also gives rise to a stronger notion and to two parallel concepts of pseudocompactness. Our purpose is to investigate the relationship between these four concepts and establish or refute each of them for several basic theories in continuous logic. Pseudofiniteness and pseudocompactness turn out to be equivalent for relational languages with constant symbols, and the four notions coincide with the standard pseudofiniteness in the case of classical structures, but the details appear to be slightly more important here than in the usual translation of definitions from classical logic. We also prove that injective “formula-definable” endofunctions are surjective, and conversely, in strongly pseudofinite omega-saturated structures.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,122

External links

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

Through your library

Similar books and articles

On algebraic closure in pseudofinite fields.Özlem Beyarslan & Ehud Hrushovski - 2012 - Journal of Symbolic Logic 77 (4):1057-1066.
Reduced products and sheaves of metric structures.Vinicius Cifú Lopes - 2013 - Mathematical Logic Quarterly 59 (3):219-229.
Continuous first order logic for unbounded metric structures.Itaï Ben Yaacov - 2008 - Journal of Mathematical Logic 8 (2):197-223.
Definability of groups in ℵ₀-stable metric structures.Itaï Ben Yaacov - 2010 - Journal of Symbolic Logic 75 (3):817-840.
On Metric Types That Are Definable in an O-Minimal Structure.Guillaume Valette - 2008 - Journal of Symbolic Logic 73 (2):439 - 447.
A Łoś type theorem for linear metric formulas.Seyed-Mohammad Bagheri - 2010 - Mathematical Logic Quarterly 56 (1):78-84.

Analytics

Added to PP
2015-07-22

Downloads
44 (#336,932)

6 months
8 (#241,888)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Definable closure in randomizations.Uri Andrews, Isaac Goldbring & H. Jerome Keisler - 2015 - Annals of Pure and Applied Logic 166 (3):325-341.
Independence in randomizations.Uri Andrews, Isaac Goldbring & H. Jerome Keisler - 2019 - Journal of Mathematical Logic 19 (1):1950005.

Add more citations

References found in this work

Thorn-forking in continuous logic.Clifton Ealy & Isaac Goldbring - 2012 - Journal of Symbolic Logic 77 (1):63-93.
The Elementary Theory of Finite Fields.James Ax - 1973 - Journal of Symbolic Logic 38 (1):162-163.

Add more references