Skip to main content

Forcing Axioms, Finite Conditions and Some More

  • Conference paper
Book cover Logic and Its Applications (ICLA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7750))

Included in the following conference series:

Abstract

We survey some classical and some recent results in the theory of forcing axioms, aiming to present recent breakthroughs and interest the reader in further developing the theory. The article is written for an audience of logicians and mathematicians not necessarily familiar with set theory.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abraham, U., Rubin, M., Shelah, S.: On the consistency of some partition theorems for continuous colorings, and the structure of \(\aleph_1\)-dense ordered sets. Ann. Pure and Applied Logic 29(2), 123–206 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  2. Abraham, U., Todorčević, S.: Partition properties of ω 1 compatible with CH. Fund. Math. 152, 165–181 (1997)

    MathSciNet  MATH  Google Scholar 

  3. Avraham, U., Shelah, S.: Martin’s Axiom does not imply that every two \(\aleph_1\)-dense sets of reals are isomorphic. Israel J. Math. 38(1-2), 161–176 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  4. Baumgartner, J.E.: All \(\aleph_1\)-dense sets of reals can be isomorphic. Fund. Math. 79(2), 101–106 (1973)

    MathSciNet  MATH  Google Scholar 

  5. Baumgartner, J.E.: Iterated forcing. In: Mathias, A.R.D. (ed.) Surveys in Set Theory. London Math. Soc. Lecture Note Ser., vol. 87, pp. 1–59. Cambridge Univ. Press, Cambridge (1983)

    Chapter  Google Scholar 

  6. Baumgartner, J.E.: Applications of the proper forcing axiom. In: Kunen, K., Vaughan, J.E. (eds.) Handbook of Set-theoretic Topology, pp. 913–959. North-Holland, Amsterdam (1984)

    Google Scholar 

  7. Bekkali, M.: Topics in Set Theory. Springer, Heidelberg (1991)

    MATH  Google Scholar 

  8. Cantor, G.: Ein Beitrag zur Mannigfaltigkeitslehre. Journal für die reine und angewandte Mathematik 187, 242–258 (1878)

    Article  Google Scholar 

  9. Cohen, P.: The independence of the continuum hypothesis. Proc. Nat. Acad. Sci. USA 50(6), 1143–1148 (1963)

    Article  Google Scholar 

  10. Dolinar, G., Džamonja, M.: Forcing \(\mbox{Square}_{\omega_1}\) with finite conditions. Ann. of Pure and Appl. Logic 164, 49–64 (2013)

    Article  MATH  Google Scholar 

  11. Džamonja, M., Shelah, S.: Universal graphs at the successor of a singular cardinal. J. Symbol. Logic 68, 366–387 (2003)

    Article  MATH  Google Scholar 

  12. Foreman, M., Magidor, M., Shelah, S.: Martin’s Maximum, saturated ideals, and nonregular ultrafilters. I. Ann. of Math. (2) 127(1), 1–47 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  13. Fraenkel, A.A., Bar-Hillel, Y., Lévy, A.: Foundations of Set Theory, 2nd revised edn. North-Holland, Amsterdam (1973)

    MATH  Google Scholar 

  14. Friedman, S.D.: Forcing with finite conditions. In: Bagaria, J., Todorčević, S. (eds.) Set Theory: Centre de Recerca Matemàtica, Barcelona 2003–04. Trends in Mathematics, pp. 285–296. Birkhäuser Verlag, Basel (2006)

    Google Scholar 

  15. Gitik, M., Magidor, M.: SPFA by finite conditions (preprint, 2012)

    Google Scholar 

  16. Gödel, K.: Über formal unentscheidbare Säztze der Principia Mathematica und verwandter Systeme, I. Monatshefte für Mathematik und Physik 38, 173–198 (1931)

    Article  Google Scholar 

  17. Gödel, K.: The consistency of the axiom of choice and of the generalized continuum hypothesis. Proc. Nat. Acad. Sci. 24, 556–557 (1938)

    Article  Google Scholar 

  18. Goldstern, M., Shelah, S.: The bounded proper forcing axiom. J. Symbol. Logic 60, 50–73 (1995)

    MathSciNet  Google Scholar 

  19. Fremlin, D.H.: Consequences of Martin’s Axiom. Cambridge tracts in Mathematics. Cambridge University Press, Cambridge (1984)

    Book  MATH  Google Scholar 

  20. Koszmider, P.: On the existence of strong chains in \({\mathcal P}(\omega_1)/{\rm Fin}\). J. Symbol. Logic 63(3), 1055–1062 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  21. Laver, R.: On the consistency of Borel’s conjecture. Acta Math. 137, 151–169 (1976)

    Article  MathSciNet  Google Scholar 

  22. Martin, D., Solovay, R.M.: Internal Cohen extensions. Ann. Math. Logic 2, 143–178 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  23. Mitchell, W.J.: Adding closed unbounded subsets of ω 2 with finite forcing. Notre Dame J. Formal Logic 46(3), 357–371 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  24. Moore, J.T.: Set mapping reflection. J. Math. Logic 5, 87–97 (2005)

    Article  MATH  Google Scholar 

  25. Neeman, I.: Forcing with sequences of models of two types (2011) (preprint), http://www.math.ucla.edu/~ineeman

  26. Rosłanowski, A., Shelah, S.: Iteration of λ-complete forcing notions not collapsing λ  + . Int. J. Math. Math. Sci. 28, 63–82 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  27. Sacks, G.E.: Forcing with perfect closed sets. In: Scott, D. (ed.) Axiomatic Set Theory. Symposia in Pure Mathematics, vol. 13, pp. 331–355. American Mathematical Society, Providence (1971)

    Google Scholar 

  28. Shelah, S.: A weak generalization of MA to higher cardinals. Israel J. Math. 30(4), 297–306 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  29. Shelah, S.: Semiproper forcing axiom implies Martin Maximum but not PFA + . J. Symbol. Logic 52(2), 360–367 (1987)

    Article  MATH  Google Scholar 

  30. Shelah, S.: Proper and improper forcing, 2nd edn. Perspectives in Mathematical Logic. Springer, Berlin (1998)

    MATH  Google Scholar 

  31. Solovay, R.M., Tennenbaum, S.: Iterated Cohen extensions and Souslin’s problem. Ann. of Math. 94(2), 201–245 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  32. Todorčević, S.: A note on the proper forcing axiom. In: Axiomatic Set Theory (Boulder, Colorado 1983). Contemporary Mathematics, vol. 31, pp. 209–218. Amer. Math. Soc., Providence (1984)

    Google Scholar 

  33. Todorčević, S.: Partition problems in topology. American Mathematical Society, Rhode (1989)

    MATH  Google Scholar 

  34. Veličković, B.: Forcing axioms and stationary sets. Adv. Math. 94(2), 256–284 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  35. Veličković, B., Venturi, G.: Proper forcing remastered (2011) (preprint), http://arxiv.org/pdf/1110.0610.pdf

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Džamonja, M. (2013). Forcing Axioms, Finite Conditions and Some More. In: Lodaya, K. (eds) Logic and Its Applications. ICLA 2013. Lecture Notes in Computer Science, vol 7750. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36039-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36039-8_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36038-1

  • Online ISBN: 978-3-642-36039-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics