Scott’s problem for Proper Scott sets
Victoria Gitman
Source: J. Symbolic Logic Volume 73, Issue 3
(2008), 845-860.
Abstract
Some 40 years ago, Dana Scott proved that every countable Scott set is the standard system of a model of PA. Two decades later, Knight and Nadel extended his result to Scott sets of size ω1. Here, I show that assuming the Proper Forcing Axiom (PFA), every A-proper Scott set is the standard system of a model of PA. I define that a Scott set 𝔛 is proper if the quotient Boolean algebra 𝔛/Fin is a proper partial order and A-proper if 𝔛 is additionally arithmetically closed. I also investigate the question of the existence of proper Scott sets.
First Page:
Show
Hide
Full-text: Access denied (no subscription
detected)
We're sorry, but we are unable to provide
you with the full text of this article because we are not able to identify
you as a subscriber.
If you have a personal subscription to
this journal, then please login. If you are already logged in, then you
may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.jsl/1230396751
Digital Object Identifier: doi:10.2178/jsl/1230396751
Mathematical Reviews number (MathSciNet): MR2444272
Zentralblatt MATH identifier: 1161.03024
References
J. E. Baumgartner, Applications of the proper forcing axiom, Handbook of set theoretic topology (K. Kunen and J. Vaughan, editors), North--Holland, Amsterdam, 1984, pp. 913--959.
Mathematical Reviews (MathSciNet): MR776640
A. Blass, On certain types and models for arithmetic, Journal of Symbolic Logic, vol. 39 (1974), pp. 151--162.
Mathematical Reviews (MathSciNet): MR369050
Digital Object Identifier: doi:10.2307/2272355
JSTOR: links.jstor.org
Zentralblatt MATH: 0296.02031
A. Enayat, From bounded arithmetic to second order arithmetic via automorphisms, Logic in Tehran (A. Enayat, I. Kalantari, and M. Moniri, editors), Lecture Notes in Logic, vol. 26, Association for Symbolic Logic, 2006, pp. 87--113.
Mathematical Reviews (MathSciNet): MR2262315
A. Enayat, Uncountable expansions of the standard model of Peano arithmetic, preprint, 2006.
F. Engström, Expansions, omitting types, and standard systems, Ph.D. thesis, Chalmers University of Technology and Goteborg University, 2004.
H. Gaifman, Models and types of Peano's arithmetic, Annals of Mathematical Logic, vol. 9 (1976), no. 3, pp. 223--306.
Mathematical Reviews (MathSciNet): MR406791
V. Gitman, Applications of the Proper Forcing Axiom to models of Peano Arithmetic, Ph.D. thesis, The Graduate Center of the City University of New York, 2007.
V. Gitman, Proper and piecewise proper families of reals, 2007, preprint.
Mathematical Reviews (MathSciNet): MR2568765
Digital Object Identifier: doi:10.1002/malq.200810015
T. Jech, Set theory, third ed., Springer Monographs in Mathematics, Springer--Verlag, New York, 2003.
Mathematical Reviews (MathSciNet): MR1940513
T. Johnstone and J. D. Hamkins, The proper and semi-proper forcing axioms for forcing notions that preserve $\aleph_2$ or $\aleph_3$, (2007), preprint.
Mathematical Reviews (MathSciNet): MR2470843
Zentralblatt MATH: 1166.03030
Digital Object Identifier: doi:10.1090/S0002-9939-08-09727-X
R. Kaye, Models of Peano arithmetic, Oxford Logic Guides, vol. 15, Oxford University Press, New York, 1991.
Mathematical Reviews (MathSciNet): MR1098499
L. Kirby and J. B. Paris, Initial segments of models of Peano's axioms, Set theory and hierarchy theory, V (Proceedings of the third conference, Bierutowice, 1976), Lecture Notes in Mathematics, vol. 619, Springer--Verlag, Berlin, 1977, pp. 211--226.
Mathematical Reviews (MathSciNet): MR491157
J. Knight and M. Nadel, Models of Peano arithmetic and closed ideals, Journal of Symbolic Logic, vol. 47 (1982), no. 4, pp. 833--840.
Mathematical Reviews (MathSciNet): MR683158
Digital Object Identifier: doi:10.2307/2273102
JSTOR: links.jstor.org
Zentralblatt MATH: 0518.03032
R. Kossak and J. H. Schmerl, The structure of models of Peano arithmetic, Oxford Logic Guides, vol. 50, Oxford University Press, New York, 2006.
Mathematical Reviews (MathSciNet): MR2250469
D. Scott, Algebras of sets binumerable in complete extensions of arithmetic, Proceedings of the symposium on pure mathematics vol. V, American Mathematical Society, Providence, R.I., 1962, pp. 117--121.
Mathematical Reviews (MathSciNet): MR141595
S. Shelah, Proper and improper forcing, second ed., Perspectives in Mathematical Logic, Springer--Verlag, New York, 1998.
Mathematical Reviews (MathSciNet): MR1623206
S. Smoryński, Lectures on nonstandard models of arithmetic, Logic colloquium '82 (Florence, 1982), Studies in Logic and the Foundations of Mathematics, vol. 112, North--Holland, Amsterdam, 1984, pp. 1--70.
Mathematical Reviews (MathSciNet): MR762103
B. Veličković, Forcing axioms and stationary sets, Advances in Mathematics, vol. 94 (1992), no. 2, pp. 256--284.
Mathematical Reviews (MathSciNet): MR1174395
Digital Object Identifier: doi:10.1016/0001-8708(92)90038-M
Zentralblatt MATH: 0785.03031
A. Villaveces, Chains of end elementary extensions of models of set theory, Journal of Symbolic Logic, vol. 63 (1998), no. 3, pp. 1116--1136.
Mathematical Reviews (MathSciNet): MR1649079
Digital Object Identifier: doi:10.2307/2586730
JSTOR: links.jstor.org
Zentralblatt MATH: 0915.03034
