|
The proper and semi-proper forcing axioms for forcing notions that preserve or
Author(s):
Joel
David
Hamkins;
Thomas
A.
Johnstone
Journal:
Proc. Amer. Math. Soc.
137
(2009),
1823-1833.
MSC (2000):
Primary 03E55, 03E40
Posted:
December 15, 2008
Retrieve article in:
PDF
Abstract |
References |
Similar articles |
Additional information
Abstract:
We prove that the PFA lottery preparation of a strongly unfoldable cardinal under forces -preserving , -preserving and , with . The method adapts to semi-proper forcing, giving -preserving , -preserving and from the same hypothesis. It follows by a result of Miyamoto that the existence of a strongly unfoldable cardinal is equiconsistent with the conjunction -preserving -preserving . Since unfoldable cardinals are relatively weak as large cardinal notions, our summary conclusion is that in order to extract significant strength from PFA or SPFA, one must collapse to .
References:
-
- [DH06]
- Mirna Džamonja and Joel David Hamkins.
Diamond (on the regulars) can fail at any strongly unfoldable cardinal. Annals of Pure and Applied Logic, 144:83-95, December 2006. Conference in honor of the sixtieth birthday of James E. Baumgartner. MR 2279655 (2007m:03091) - [Fuc]
- Ulrich Fuchs.
Donder's version of revised countable support. arXiv:math.LO/9207204. - [GS95]
- Martin Goldstern and Saharon Shelah.
The bounded proper forcing axiom. J. Symbolic Logic, 60(1):58-73, 1995. MR 1324501 (96g:03083) - [Ham]
- Joel David Hamkins.
A class of strong diamond principles. arXiv:math.LO/0211419. - [Ham00]
- Joel David Hamkins.
The lottery preparation. Ann. Pure Appl. Logic, 101(2-3):103-146, 2000. MR 1736060 (2001i:03108) - [Hau91]
- Kai Hauser.
Indescribable cardinals and elementary embeddings. Journal of Symbolic Logic, 56:439-457, 1991. MR 1133077 (92j:03049) - [HJ]
- Joel David Hamkins and Thomas A. Johnstone.
Indestructible strong unfoldability, submitted. - [Joh]
- Thomas A. Johnstone.
Strongly unfoldable cardinals made indestructible. Journal of Symbolic Logic, 73(4):1215-1248, 2008. - [Joh07]
- Thomas A. Johnstone.
Strongly unfoldable cardinals made indestructible. Ph.D. thesis, The Graduate Center of the City University of New York, June 2007. - [Lav78]
- Richard Laver.
Making the supercompactness of indestructible under -directed closed forcing. Israel Journal of Mathematics, 29:385-388, 1978. MR 0472529 (57:12226) - [Men74]
- Telis K. Menas.
On strong compactness and supercompactness. Annals of Mathematical Logic, 7:327-359, 1974. MR 0357121 (50:9589) - [Miy98]
- Tadatoshi Miyamoto.
A note on weak segments of PFA. In Proceedings of the Sixth Asian Logic Conference (Beijing, 1996), pages 175-197, World Sci. Publishing, River Edge, NJ, 1998. MR 1789737 (2001g:03092) - [Nee08]
- Itay Neeman.
Hierarchies of forcing axioms, II. Journal of Symbolic Logic, 73:522-542, 2008. MR 2414463 - [NS08]
- Itay Neeman and Ernest Schimmerling.
Hierarchies of forcing axioms, I. Journal of Symbolic Logic, 73:343-362, 2008. MR 2387946 - [Vil98]
- Andrés Villaveces.
Chains of end elementary extensions of models of set theory. Journal of Symbolic Logic, 63(3):1116-1136, 1998. MR 1649079 (2000h:03074)
Similar Articles:
Retrieve articles in Proceedings of the American Mathematical Society
with MSC
(2000):
03E55, 03E40
Retrieve articles in all Journals with MSC
(2000):
03E55, 03E40
Additional Information:
Joel
David
Hamkins
Affiliation:
Department of Mathematics, The Graduate Center of The City University of New York, 365 Fifth Avenue, New York, New York 10016 - and - Department of Mathematics, The College of Staten Island of The City University of New York, Staten Island, New York 10314
Email:
jhamkins@gc.cuny.edu
Thomas
A.
Johnstone
Affiliation:
Department of Mathematics, New York City College of Technology of The City University of New York, 300 Jay Street, Brooklyn, New York 11201
Email:
tjohnstone@citytech.cuny.edu
DOI:
10.1090/S0002-9939-08-09727-X
PII:
S 0002-9939(08)09727-X
Keywords:
Forcing axiom,
strongly unfoldable cardinal
Received by editor(s):
November 20, 2007,
Received by editor(s) in revised form:
August 13, 2008
Posted:
December 15, 2008
Additional Notes:
The research of the first author has been supported in part by grants from the CUNY Research Foundation and the Netherlands Organization for Scientific Research (NWO), and he is grateful to the Institute of Logic, Language and Computation at Universiteit van Amsterdam for the support of a Visiting Professorship during his 2007 sabbatical there.
Parts of this article are adapted from the second author's Ph.D. dissertation, The Graduate Center of The City University of New York, June 2007
Communicated by:
Julia Knight
Copyright of article:
Copyright
2008,
American Mathematical Society
The copyright for this article reverts to public domain after 28 years from publication.
|