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

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
Keywords Infinitary logic  Hyperarithmetical hierarchy  Iterated forcing
Categories (categorize this paper)
DOI 10.1007/s00153-013-0322-2
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 65,599
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

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

Citations of this work BETA

No citations found.

Add more citations

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.
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.


Added to PP index

Total views
25 ( #443,558 of 2,462,148 )

Recent downloads (6 months)
1 ( #449,335 of 2,462,148 )

How can I increase my downloads?


My notes