An example related to Gregory’s Theorem

Archive for Mathematical Logic 52 (3-4):419-434 (2013)
  Copy   BIBTEX

Abstract

In this paper, we give an example of a complete computable infinitary theory T with countable models ${\mathcal{M}}$ and ${\mathcal{N}}$ , where ${\mathcal{N}}$ is a proper computable infinitary extension of ${\mathcal{M}}$ and T has no uncountable model. In fact, ${\mathcal{M}}$ and ${\mathcal{N}}$ are (up to isomorphism) the only models of T. Moreover, for all computable ordinals α, the computable ${\Sigma_\alpha}$ part of T is hyperarithmetical. It follows from a theorem of Gregory (JSL 38:460–470, 1972; Not Am Math Soc 17:967–968, 1970) that if T is a Π 1 1 set of computable infinitary sentences and T has a pair of models ${\mathcal{M}}$ and ${\mathcal{N}}$ , where ${\mathcal{N}}$ is a proper computable infinitary extension of ${\mathcal{M}}$ , then T would have an uncountable model

Links

PhilArchive



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

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

Partitions of large Rado graphs.M. Džamonja, J. A. Larson & W. J. Mitchell - 2009 - Archive for Mathematical Logic 48 (6):579-606.
Why is $$\mathcal{CPT}$$ Fundamental?O. W. Greenberg - 2006 - Foundations of Physics 36 (10):1535-1553.
Computable structures and the hyperarithmetical hierarchy.C. J. Ash - 2000 - New York: Elsevier. Edited by J. Knight.
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
Observables and Statistical Maps.Stan Gudder - 1999 - Foundations of Physics 29 (6):877-897.
Covering properties of ideals.Marek Balcerzak, Barnabás Farkas & Szymon Gła̧b - 2013 - Archive for Mathematical Logic 52 (3-4):279-294.
Classical Modal De Morgan Algebras.Sergio A. Celani - 2011 - Studia Logica 98 (1-2):251-266.
Embedding FD(ω) into {mathcal{P}_s} densely.Joshua A. Cole - 2008 - Archive for Mathematical Logic 46 (7-8):649-664.

Analytics

Added to PP
2013-12-01

Downloads
31 (#498,916)

6 months
4 (#797,377)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Model theory for infinitary logic.H. Jerome Keisler - 1971 - Amsterdam,: North-Holland Pub. Co..
Infinitary logic and admissible sets.Jon Barwise - 1969 - Journal of Symbolic Logic 34 (2):226-252.
The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.

View all 13 references / Add more references