Skip to main content Accessibility help
×
Home

Hierarchies of forcing axioms II

  • Itay Neeman

Abstract

A truth for λ is a pair 〈Q, ψ〉 so that QHλ, ψ is a first order formula with one free variable, and there exists BHλ+ such that (Hλ+; ∈, B) ⊨ ψ[Q]. A cardinal λ is , indescribable just in case that for every truth 〈Q, ψ〈 for λ, there exists < λ so that is a cardinal and 〈Q ∩ , ψ) is a truth for . More generally, an interval of cardinals [κ, λ] with κ ≤ λ is indescribable if for every truth 〈Q, ψ〈 for λ, there exists , and π: Hλ so that is a cardinal, is a truth for , and π is elementary from () into (H; ∈, κ, Q) with id.

We prove that the restriction of the proper forcing axiom to ϲ-linked posets requires a indescribable cardinal in L, and that the restriction of the proper forcing axiom to ϲ+-linked posets, in a proper forcing extension of a fine structural model, requires a indescribable 1-gap [κ, κ+]. These results show that the respective forward directions obtained in Hierarchies of Forcing Axioms I by Neeman and Schimmerling are optimal.

Copyright

Corresponding author

Department of Mathematics, University of California Los Angeles, Los Angeles, CA 90095-1555, USA, E-mail: ineeman@math.ucla.edu

References

Hide All
[1]Baumgartner, J., Malitz, J., and Reinhardt, W., Embedding trees in the rationals, Proceedings of the National Academy of Sciences of the United States of America, vol. 67 (1970), pp. 17481753.
[2]Bekkali, M., Topics in set theory, Lecture Notes in Mathematics, vol. 1476, Springer-Verlag, Berlin, 1991, Notes on lectures by Stevo Todorčević.
[3]Dodd, Tony and Jensen, Ronald, The covering lemma for K, Annals of Mathematical Logic, vol. 22 (1982), no. 1, pp. 130.
[4]Goldstern, Martin and Shelah, Saharon, The bounded proper forcing axiom, this Journal, vol. 60 (1995), no. 1, pp. 5873.
[5]Jech, Thomas, Set theory, Springer Monographs in Mathematics, Springer-Verlag, Berlin, 2003, The third millennium edition, revised and expanded.
[6]Miyamoto, Tadatoshi, A note on weak segments of PFA, Proceedings of the Sixth Asian Logic Conference (Beijing, 1996), World Scientific Publishing, River Edge, NJ, 1998, pp. 175197.
[7]Neeman, Itay and Schimmerling, Ernest, Hierachies of forcing axioms I, this Journal, vol. 73 (2008), no. 1, pp. 343362.
[8]Schimmerling, Ernest, Combinatorial principles in the core model for one Woodin cardinal, Annals of Pure and Applied Logic, vol. 74 (1995), no. 2, pp. 153201.
[9]Schimmerling, Ernest, Coherent sequences and threads, Advances in Mathematics, to appear.
[10]Schimmerling, Ernest and Zeman, Martin, Square in core models, The Bulletin of Symbolic Logic, vol. 7 (2001), no. 3, pp. 305314.
[11]Schimmerling, Ernest and Zeman, Martin, Characterization of ☐κ in core models, Journal of Mathematical Logic, vol. 4 (2004), no. 1, pp. 172.
[12]Steel, John R., PFA implies ADL(ℝ), this Journal, vol. 70 (2005), no. 4, pp. 12551296.
[13]Todorčević, Stevo, A note on the proper forcing axiom, Axiomatic set theory (Boulder, CO, 1983), Contemporary Mathematics, vol. 31, American Mathematical Society, Providence, RI, 1984, pp. 209218.
[14]Todorčević, Stevo, Localized reflection and fragments of PFA, Set theory (Piscataway, NJ, 1999), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 58, American Mathematical Society, Providence, RI, 2002, pp. 135148.
[15]Veličković, Boban, Forcing axioms and stationary sets, Advances in Mathematics, vol. 94 (1992), no. 2, pp. 256284.
[16]Welch, Phillip D., Ph.D. thesis, Oxford University, 1979.
[17]Zeman, Martin, Inner models and large cardinals, de Gruyter Series in Logic and its Applications, vol. 5, Walter de Gruyter & Co., Berlin, 2002.
[18]Zeman, Martin, Global square on singular cardinals, to appear.

Related content

Powered by UNSILO

Hierarchies of forcing axioms II

  • Itay Neeman

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.