Skip to main content
SpringerLink
Log in

Laver and set theory

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

In this commemorative article, the work of Richard Laver is surveyed in its full range and extent.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Apter A.W., Hamkins J.D.: Universal indestructibility. Kobe J. Math. 16, 119–130 (1999)

    MathSciNet  MATH  Google Scholar 

  2. Apter A.W.: Laver indestructibility and the class of compact cardinals. J. Symb. Log. 63, 149–157 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bagaria, J., Hamkins, J.D., Tsaprounis, K., Usuba, T.: Superstrong and other large cardinals are never Laver indestructible (2013). http://arxiv.org/abs/1307.3486

  4. Bartoszyński T., Judah H.: Set Theory. On the Structure of the Real Line. AK Peters, Wellesley (1995)

    MATH  Google Scholar 

  5. Baumgartner J., Hajnal A.: A proof (involving Martin’s Axiom) of a partition relation. Fundamenta Mathematicae 78, 193–203 (1973)

    MathSciNet  MATH  Google Scholar 

  6. Baumgartner J.E., Taylor A.D.: Saturation properties of ideals in generic extensions. II. Trans. Am. Math. Soc. 271, 587–609 (1982)

    MathSciNet  MATH  Google Scholar 

  7. Baumgartner J.E.:: Iterated forcing. In: Mathias, A. (ed.) Surveys in Set Theory, London Mathematical Society Lecture Note Series, vol. 83, pp. 1–59. Cambridge University Press, Cambridge (1983)

    Google Scholar 

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

  9. Benko P.: The Benko Gambit. Batsford, London (1974)

    Google Scholar 

  10. Borel É.: Sur la classification des ensembles de mesure nulle. Bulletin de la Société Mathématique de France 47, 97–125 (1919)

    MathSciNet  MATH  Google Scholar 

  11. Cantor, G.: Beiträge zur Begründrung der transfiniten Mengenlehre. I. Mathematische Annalen 46, 481–512, 1895. Translated in Contributions to the Founding of the Theory of Transfinite Numbers, Open Court, Chicago 1915; reprinted Dover, New York (1965)

  12. Carlson T.J., Simpson S.G.: A dual form of Ramsey’s theorem. Adv. Math. 53, 265–290 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  13. Carlucci L., Dehornoy P., Weiermann A.: Unprovability results involving braids. Proc. Lond. Math. Soc. 102, 159–192 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  14. Corazza P.: The Wholeness Axiom and Laver sequences. Ann. Pure Appl. Log. 105, 157–260 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  15. Cummings J., Foreman M.: The tree property. Adv. Math. 133, 1–32 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  16. Cummings J.: Souslin trees which are hard to specialize. Proc. Am. Math. Soc. 125, 2435–2441 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  17. Dales H.G., Woodin W.H.: An Introduction to Independence for Analysts, London Mathematical Society Lecture Note Series, vol. 115. Cambridge University Press, Cambridge (1987)

    Book  Google Scholar 

  18. Dehornoy P.: An alternative proof of Laver’s results on the algebra generated by an elementary embedding. In: Judah, H., Just, W., Woodin, W.H. (eds.) Set Theory of the Continuum, Mathematical Sciences Research Institute Publications, vol. 26, pp. 27–33. Springer, Berlin (1992)

    Google Scholar 

  19. Dehornoy P.: Preuve de la conjecture d’irreflexivité pour les structures distributives libres. Comptes Rendues de l’Académie des Sciences de Paris 314, 333–336 (1992)

    MathSciNet  MATH  Google Scholar 

  20. Dehornoy P.: Braid groups and left distributive operations. Trans. Am. Math. Soc. 345, 115–150 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  21. Dehornoy P.: Elementary embeddings and algebra. In: Foreman, M., Kanamori, A. (eds.) Handbook of Set Theory, vol. 2, pp. 737–774. Springer, Dordrecht (2010)

    Chapter  Google Scholar 

  22. Devlin K.J.: Yorkshireman’s guide to proper forcing. In: Mathias, A. (ed.) Surveys in Set Theory, London Mathematical Society Lecture Note Series, vol. 83, pp. 60–115. Cambridge University Press, Cambridge (1983)

    Google Scholar 

  23. Dougherty R., Jech T.J.: Finite left-distributive algebras and embedding algebras. Adv. Math. 130, 213–241 (1997)

    Article  MathSciNet  Google Scholar 

  24. Dougherty R.: Critical points in an algebra of elementary embeddings. Ann. Pure Appl. Log 65, 211–241 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  25. Dushnik B., Miller E.: Concerning similarity transformations of linearly ordered sets. Bull. Am. Math. Soc. 46, 322–326 (1940)

    Article  MathSciNet  Google Scholar 

  26. Erdős P., Hajnal A.: Solved and unsolved problems in set theory. In: Henkin, L. (ed.) Proceedings of the Tarski Symposium, Proceeding of Symposia in Pure Mathematics, vol. 25, pp. 269–287. American Mathematical Society, Providence (1974)

    Google Scholar 

  27. Foreman M., Hajnal A.: A partition relation for successors of large cardinals. Math. Ann. 325, 583–623 (2003)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  29. Foreman M., Magidor M., Shelah S.: Martin’s Maximum, saturated ideals and nonregular ultrafilters. Part II. Ann. Math. 127, 521–545 (1988b)

    Article  MathSciNet  Google Scholar 

  30. Foreman M.: An ℵ1-dense ideal on ℵ2. Israel J. Math. 108, 253–290 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  31. Fraïssé R.: Sur la comparaison des types d’ordres. Comptes rendus hebdomadaires des séances de l’Académie des Sciences, Paris 226, 1330–1331 (1948)

    MATH  Google Scholar 

  32. Fuchs, G., Hamkins, J.D., Reitz, J.: Set-theoretic geology (2011). http://arxiv.org/abs/1107.4776

  33. Gitik M., Shelah S.: On certain indestructibility of strong cardinals and a question of Hajnal. Arch. Math. Log. 28, 35–42 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  34. Halpern J.D., Läuchli H.: A partition theorem. Trans. Am. Math. Soc. 124, 360–367 (1966)

    Article  MATH  Google Scholar 

  35. Halpern J.D., Levy A.: The Boolean Prime Ideal does not imply the Axiom of Choice. In: Scott, D.S. (ed.) Axiomatic Set Theory, Proceedings of Symposia in Pure Mathematics, vol. 13(1), pp. 83–134. Americal Mathematical Society, Providence (1971)

    Google Scholar 

  36. Hamkins J.D., Reitz J., Woodin W.H.: The Ground Axiom is consistent with V ≠ HOD. Proc. Am. Math. Soc. 136, 2943–2949 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  37. Hamkins J.D.: The lottery preparation. Ann. Pure Appl. Log. 101, 103–146 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  38. Hamkins J.D.: Extensions with the approximation and cover properties have no new large cardinals. Fund. Math. 180, 237–277 (2003)

    Article  MathSciNet  Google Scholar 

  39. Hausdorff, F.: Untersuchungen über Ordnungstypen IV, V. Berichte über die Verhandlungen der Königlich Sächsischen Gesellschaft der Wissenschaften zu Leipzig, Mathematisch-Physische Klasse 59, 84–159 (1907). Translated with an introduction in Jacob Plotkin, editor, Hausdorff on Ordered Sets, American Mathematical Society, pp. 97–171 (2005)

  40. Hausdorff, F.: Grundzüge einer Theorie der geordneten Mengen. Mathematische Annalen, 65, 435–505, (1908). Translated with an introduction in Jacob Plotkin, editor, Hausdorff on Ordered Sets, American Mathematical Society, (2005) pp. 181–258

  41. Higman G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. 2, 326–336 (1952)

    Article  MathSciNet  MATH  Google Scholar 

  42. Ishiu T., Moore J.T.: Minimality of non-σ-scattered orders. Fund. Math. 205, 29–44 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  43. Judah H., Shelah S.: The Kunen–Miller chart (Lebesgue measure, the Baire property, Laver reals and preservation theorems for forcing). J. Symb. Log. 55, 909–927 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  44. Judah H., Shelah S., Woodin W.H.: The Borel conjecture. Ann. Pure Appl. Log. 50, 255–269 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  45. Kanamori, A., Woods, J., Gabbay, D. (eds.): Sets and Extensions in the Twentieth Century, Handbook of the History of Logic, vol. 6. Elsevier, Amsterdam (2012)

    Google Scholar 

  46. Kanamori A.: Weakly normal ultrafilters and irregular ultrafilters. Trans. Am. Math. Soc. 220, 393–399 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  47. Kanamori A.: Finest partitions for ultrafilters. J. Symb. Log. 51, 327–332 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  48. Kanamori A.: Partition relations for successor cardinals. Adv. Math. 59, 152–169 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  49. Ketonen J.: Nonregular ultrafilters and large cardinals. Trans. Am. Math. Soc. 224, 61–73 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  50. Kozen D.: A finite model theorem for the propositional μ-calculus. Studia Logica 47, 233–241 (1988)

    Article  MathSciNet  Google Scholar 

  51. Kruskal J.: Well-quasi-ordering, the tree theorem, and V ázsonyi’s conjecture. Trans. Am. Math. Soc. 95, 210–225 (1960)

    MathSciNet  MATH  Google Scholar 

  52. Kunen K.: Saturated ideals. J. Symb. Log. 43, 65–76 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  53. Larue D.M.: On braid words and irreflexivity. Algebra Universalis 31, 104–112 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  54. Laver, R.: Well-quasi-ordering scattered order types. In: Guy, R. et al., (ed,) Combinatorial Structures and their Applications. Proceedings of the Calgary International Conference, Gordon and Breach, New York (1970)

  55. Laver R.: On Fraïssé’s order type conjecture. Ann. Math. 93, 89–111 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  56. Laver R.: An order type decomposition theorem. Ann. Math. 98, 96–119 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  57. Laver, R.: On strong measure zero sets. In: Hajnal, A. et al. (eds) Infinite and Finite Sets. Keszthely (Hungary), 1973, vol. II, Colloquia Mathematica Societatis János Bolyai 10, pp. 1025–1027. North-Holland, Amsterdam (1975)

  58. Laver, R.: Partition relations for uncountable cardinals \({\leq 2^{\aleph_{0}}}\) . In: Hajnal, A., et al. (eds.), Infinite and Finite Sets. Keszthey (Hungary), 1973, vol. II, Colloquia Mathematica Societatis János Bolyai 10, pp. 1029–1042. North-Holland, Amsterdam (1975)

  59. Laver R.: Well-quasi-orderings and sets of finite sequences. Math. Proc. Cambr. Philos. Soc. 79, 1–10 (1976)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  61. Laver R.: A set in L containing regularizing families for ultrafilters. Mathematika 24, 50–51 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  62. Laver R.: A saturation property on ideals. Compositio Mathematica 36, 233–242 (1978)

    MathSciNet  MATH  Google Scholar 

  63. Laver R.: Making the supercompactness of κ indestructible under κ-directed closed forcing. Israel J. Math. 29, 385–388 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  64. Laver, R.: Better-quasi-orderings and a class of trees. In: Studies in Foundations and Combinatorics, Advances in Mathematics Supplementary Studies 1, pp. 31–48. Academic Press, New York (1978)

  65. Laver R.: Strong saturation properties of ideals (abstract). J. Symb. Log. 43, 371 (1978)

    Google Scholar 

  66. Laver, R.: Linear orders in (ω)ω under eventual dominance. In: Boffa, M., et al. (eds.) Logic Colloquium ’78, Studies in Logic and the Foundations of Mathematics, vol. 97, pp. 299–302. North-Holland, Amsterdam (1979)

  67. Laver R.: (with James Baumgartner) Iterated perfect-set forcing. Ann. Math. Log. 17, 271–288 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  68. Laver R.: (with Saharon Shelah) The \({\aleph_{2}}\) -Souslin hypothesis. Trans. Am. Math. Soc. 264, 411–417 (1981)

    MathSciNet  MATH  Google Scholar 

  69. Laver, R.: An \({(\aleph_{2}, \aleph_{2}, \aleph_{0})}\) -saturated ideal on ω1. In: van Dalen, D. et al. (eds.) Logic Colloquium ’80, Studies in Logic and the Foundations of Mathematics, vol. 108, pp. 173–180. North-Holland, Amsterdam (1982)

  70. Laver, R.: Saturated ideals and nonregular ultrafilters. In: Metakides, G. (ed.) Patras Logic Symposion, Studies in Logic and the Foundations of Mathematics, vol. 109, pages 297–305. North-Holland, Amsterdam (1982)

  71. Laver R.: Products of infinitely many perfect trees. J. Lond. Math. Soc. 29, 385–396 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  72. Laver R.: Embeddings of a rank into itself. Abstr. Pap. Present. Am. Math. Soc. 7, 6 (1986)

    Google Scholar 

  73. Laver R.: Random reals and Souslin trees. Proc. Am. Math. Soc. 100, 531–534 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  74. Laver R.: (with Matthew Foreman) Some downwards transfer properties for \({\aleph_{2}}\) . Adv. Math. 67, 230–238 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  75. Laver R.: (with Tim Carlson) Sacks reals and Martin’s Axiom. Fundamenta Mathematicae 133, 161–168 (1989)

    MathSciNet  MATH  Google Scholar 

  76. Laver R.: The left distributive law and the freeness of an algebra of elementary embeddings. Adv. Math. 91, 209–231 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  77. Laver R.: A division algorithm for the free left distributive algebra. In: Oikkonen, J., Väänänen, J. (eds.) Logic Colloquium ’90, Lecture Notes in Logic 2, pp. 155–162. Springer, Berlin (1993)

    Google Scholar 

  78. Laver R.: On the algebra of elementary embeddings of a rank into itself. Adv. Math. 110, 334–346 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  79. Laver R.: Braid group actions on left distributive structures, and well orderings in the braid groups. J. Pure Appl. Algebra 108, 81–98 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  80. Laver R.: Adding dominating functions mod finite. Periodica Mathematica Hungarica 35, 35–41 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  81. Laver R.: Implications between strong large cardinal axioms. Ann. Pure Appl. Logic 90, 79–90 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  82. Laver, R.: (with Carl Darby) Countable length Ramsey games. In: Di Prisco, C. et al. (ed.) Set Theory: Techniques and Applications, pp. 41–46. Kluwer, Dordrecht (1998)

  83. Laver R.: Reflection of elementary embedding axioms on the L[V λ +1] hierarchy. Ann. Pure Appl. Log. 107, 227–238 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  84. Laver, R.: On very large cardinals. In: Hálasz, G. et al. (ed.) Paul Erdős and his Mathematics, vol. II, Bolyai Society Mathematical Studies 11, pp. 453–469. Springer, Berlin (2002)

  85. Laver R.: (with John Moody) Well-foundedness conditions connected with left-distributivity. Algebra Universalis 47, 65–68 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  86. Laver R.: Certain very large cardinals are not created in small forcing extensions. Ann. Pure Appl. Log. 149, 1–6 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  87. Laver R.: (with Sheila Miller) Left division in the free left distributive algebra on one generator. J. Pure Appl. Algebra 215(3), 276–282 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  88. Laver R.: (with Sheila Miller) The free one-generated left distributive algebra: basics and a simplified proof of the division algorithm. Cent. Eur. J. Math. 11(12), 2150–2175 (2013)

    MathSciNet  MATH  Google Scholar 

  89. Magidor M.: On the singular cardinals problem II. Ann. Math. 106, 517–547 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  90. Magidor M.: On the existence of nonregular ultrafilters and cardinality of ultrapowers. Trans. Am. Math. Soc. 249, 97–111 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  91. Marcone A., Montalbán A.: On Fraïssé’s conjecture for linear orders of finite Hausdorff rank. Ann. Pure Appl. Log. 160, 355–367 (2009)

    Article  MATH  Google Scholar 

  92. Marcone A.: WQO and BQO theory in subsystems of second order arithmetic. In: Simpson, S.G. (ed.) Reverse Mathematics 2001, Lectures Notes in Logic, vol. 21, pp. 303–330. AK Peters, Wellesley (2005)

    Google Scholar 

  93. Martin D.A.: Infinite games. In: Lehto, O. (ed.) Proceedings of the International Congress of Mathematicians, vol. 1, pp. 269–273. Academia Scientiarum Fennica, Helsinki (1980)

    Google Scholar 

  94. Martinez-Ranero C.: Well-quasi-ordering Aronszajn lines. Fund. Math. 213, 197–211 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  95. Menas T.: Consistency results concerning supercompactness. Trans. Am. Math. Soc. 223, 61–91 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  96. Miller A.W.: There are no Q-points in Laver’s model for the Borel conjecture. Proc. Am. Math. Soc. 78, 103–106 (1980)

    MATH  Google Scholar 

  97. Milliken K.R.: A Ramsey theorem for trees. J. Comb. Theory Ser. A 26, 215–237 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  98. Mitchell W.J.: Aronszajn trees and the independence of the transfer property. Ann. Pure Appl. Log. 5, 21–46 (1972)

    MATH  Google Scholar 

  99. Montalbán A.: Up to equimorphism, hyperarithmetic is recursive. J. Symb. Log. 70, 360–378 (2005)

    Article  MATH  Google Scholar 

  100. Montalbán A.: Equivalence between Fraïssé’s conjecture and Jullien’s theorem. Ann. Pure Appl. Log. 139, 1–42 (2006)

    Article  MATH  Google Scholar 

  101. Moore J.T.: A universal Aronszajn line. Math. Res. Lett. 16, 121–131 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  102. Nash-Williams C.S.J.A.: On well-quasi-ordering infinite trees. Proc. Cambr. Philos. Soc. 61, 697–720 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  103. Pincus, D., Halpern, J.D. (eds.): Partitions of Products, pp. 549–568. Transactions of the American Mathematical Society, pages (1981)

    Google Scholar 

  104. Prikry K.: On a problem of Gillman and Keisler. Ann. Math. Log. 2, 179–187 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  105. Prikry K.: On a problem of Erdös, Hajnal, and Rado. Discrete Math. 2, 51–59 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  106. Reitz J.: The Ground Axiom. J. Symb. Log. 72, 1299–1317 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  107. Rothberger F.: On the property C and a problem of Hausdorff. Can. J. Math. 4, 111–116 (1952)

    Article  MathSciNet  MATH  Google Scholar 

  108. Shelah S., Stanley L.J.: S-forcing, I. A “black-box” theorem for morasses, with applications to super-Souslin trees. Israel J. Math. 43, 185–224 (1982)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  110. Shelah S.: Better quasi-orders for uncountable cardinals. Israel J. Math. 42, 177–226 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  111. Shelah S.: Can you take Solovay’s inaccessible away?. Israel J. Math. 48, 1–47 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  112. Shore R.: On the strength of Fraïssé’s conjecture. In: Crossley, J., Remmel, J., Shore, R., Sweedler, M. (eds.) Logic Methods. In Honor of Anil Nerode’s Sixtieth Birthday. Progress in Computer Science and Applied Logic, vol. 12, pp. 782–813. Birkhauser, Boston (1993)

    Google Scholar 

  113. Sierpiński W.: Sur les types d’ordre de puissance du continu. Revista de Ciencias, Lima 48, 305–307 (1946)

    MATH  Google Scholar 

  114. Sierpiński W.: Sur les types d’ordre des ensembles linéaires. Fund. Math. 37, 253–264 (1950)

    MathSciNet  MATH  Google Scholar 

  115. Solovay R.M., Reinhardt W.N., Kanamori A.: Strong axioms of infinity and elementary embeddings. Ann. Math. Log. 13, 73–116 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  116. Steprāns, J.: History of the continuum in the 20th Century. In: Kanamori, A., Woods, J., Gabbay, D. (eds.) Sets and Extensions in the Twentieth Century, Handbook of the History of Logic, vol. 6 pp. 73–144. Elsevier, Amsterdam (2012)

  117. Tall F.D.: Some applications of a generalized Martin’s axiom. Topol. Appl. 57, 215–248 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  118. Todorcevic S.: Forcing positive partition relations. Trans. Am. Math. Soc. 280, 703–720 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  119. Todorcevic S.: Reals and positive partition relations. In: Marcus, R.B., Dorn, G., Weingartner, P. (eds.) Logic, Methodology and Philosophy of Science VII, pp. 159–169. North-Holland, Amsterdam (1986)

    Google Scholar 

  120. Todorcevic S.: Lipschitz maps on trees. Journal de l’Institut de Mathématiques de Jussieu. 6, 527–566 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  121. Woodin W.H.: Suitable extender models I. J. Math. Log. 10, 101–339 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  122. Woodin, W.H.: The Continuum Hypothesis, the generic-multiverse of sets, and the Ω Conjecture. In: Kennedy, J., Kossak, R. (ed.) Set Theory, Arithmetic, and Foundations of Mathematics: Theorems, Philosophies, Lecture Notes in Logic, vol. 36, pp. 13–42. Cambridge University Press, Cambridge (2011)

  123. Woodin W.H.: Suitable extender models II: beyond ω-huge. J. Math. Log. 11, 115–436 (2011)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Boston University, Boston, MA, USA

    Akihiro Kanamori

Authors
  1. Akihiro Kanamori
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Akihiro Kanamori.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kanamori, A. Laver and set theory. Arch. Math. Logic 55, 133–164 (2016). https://doi.org/10.1007/s00153-015-0462-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-015-0462-7

Keywords

Mathematics Subject Classification

Search

Navigation