Hostname: page-component-76fb5796d-2lccl Total loading time: 0 Render date: 2024-04-25T07:10:46.528Z Has data issue: false hasContentIssue false
  • English
  • Français

FORCING AND THE HALPERN–LÄUCHLI THEOREM

Published online by Cambridge University Press:  09 September 2019

NATASHA DOBRINEN  and
DANIEL HATHAWAY
NATASHA DOBRINEN
Affiliation:
DEPARTMENT OF MATHEMATICS UNIVERSITY OF DENVER C.M. KNUDSON HALL, ROOM 300 2390 S. YORK ST. DENVER, CO80208, USA E-mail: natasha.dobrinen@du.eduURL:http://web.cs.du.edu/∼ndobrine
DANIEL HATHAWAY
Affiliation:
DEPARTMENT OF MATHEMATICS UNIVERSITY OF VERMONT 82 UNIVERSITY PLACE. BURLINGTON, VT05401, USA E-mail: daniel.hathaway@uvm.eduURL: http://mysite.du.edu/∼dhathaw2/
Get access Rights & Permissions [Opens in a new window]

Abstract

We investigate the effects of various forcings on several forms of the Halpern– Läuchli theorem. For inaccessible κ, we show they are preserved by forcings of size less than κ. Combining this with work of Zhang in [17] yields that the polarized partition relations associated with finite products of the κ-rationals are preserved by all forcings of size less than κ over models satisfying the Halpern– Läuchli theorem at κ. We also show that the Halpern–Läuchli theorem is preserved by <κ-closed forcings assuming κ is measurable, following some observed reflection properties.

Keywords

03E0203E1003E3503E5503E5705D10forcinggeneric absolutenessinfinitary combinatoricspartition relationsRamsey theorylarge cardinals
Type
Articles
Information
The Journal of Symbolic Logic , Volume 85 , Issue 1 , March 2020 , pp. 87 - 102
Copyright
Copyright © The Association for Symbolic Logic 2019 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Devlin, D., Some partition theorems for ultrafilters on ω, Ph.D. thesis, Dartmouth College, 1979.CrossRefGoogle Scholar
Dobrinen, N. and Hathaway, D., The Halpern-Läuchli Theorem at a measurable cardinal, this Journal, vol. 82 (2017), no. 4, pp. 1560–1575.Google Scholar
Dodos, P. and Kanellopoulos, V., Ramsey Theory for Product Spaces, American Mathematical Society, Providence, RI, 2016.CrossRefGoogle Scholar
Džamonja, M., Larson, J., and Mitchell, W. J., A partition theorem for a large dense linear order. Israel Journal of Mathematics, vol. 171 (2009), pp. 237–284.CrossRefGoogle Scholar
Džamonja, M., Larson, J., and Mitchell, W. J., Partitions of large Rado graphs. Archive for Mathematical Logic, vol. 48 (2009), no. 6, pp. 579–606.CrossRefGoogle Scholar
Hajnal, A. and Komjáth, P., A strongly non-Ramsey order type. Combinatorica, vol. 17 (1997), no. 3, pp. 363–367.CrossRefGoogle Scholar
Halpern, J. D. and Läuchli, H., A partition theorem. Transactions of the American Mathematical Society, vol. 124 (1966), pp. 360–367.CrossRefGoogle Scholar
Halpern, J. D. and Lévy, A., The Boolean prime ideal theorem does not imply the axiom of choice, Axiomatic Set Theory, Proceedings of Symposia in Pure Mathematics, Vol. XIII, Part I, University of California, Los Angeles, California, 1967 (Scott, D. S., editor), American Mathematical Society, Providence, RI, 1971, pp. 83–134.Google Scholar
Hamkins, J. D., Small forcing makes any cardinal superdestructible, this Journal, vol. 63 (1998), pp. 51–58.Google Scholar
Laflamme, C., Sauer, N., and Vuksanovic, V., Canonical partitions of universal structures. Combinatorica, vol. 26 (2006), no. 2, pp. 183–205.CrossRefGoogle Scholar
Laver, R., Products of infinitely many perfect trees. Journal of the London Mathematical Society (2), vol. 29 (1984), no. 3, pp. 385–396.CrossRefGoogle Scholar
Milliken, K. R., A Ramsey theorem for trees. Journal of Combinatorial Theory, Series A, vol. 26 (1979), pp. 215–237.CrossRefGoogle Scholar
Sauer, N., Coloring subgraphs of the Rado graph. Combinatorica, vol. 26 (2006), no. 2, pp. 231–253.CrossRefGoogle Scholar
Shelah, S., Strong partition relations below the power set: Consistency – was Sierpinski right? II, Sets, Graphs and Numbers (Budapest, 1991) (Halasz, G., Lovasz, L., Mikloas, D., and Szonyi, T., editors), Colloquia Mathematica Societatis Janos Bolyai,vol.60, North-Holland, Amsterdam, 1992, pp. 637–688.Google Scholar
Todorcevic, S., Introduction to Ramsey Spaces, Princeton University Press, Princeton, NJ, 2010.CrossRefGoogle Scholar
Todorcevic, S. and Farah, I., Some Applications of the Method of Forcing, Yenisei Series in Pure and Applied Mathematics, Yenisei, Moscow, 1995.Google Scholar
Zhang, J., A tail cone version of the Halpern-Läuchli Theorem at a large cardinal, this Journal, vol. 84 (2019), no. 2, pp. 473–476.Google Scholar