The halpern–läuchli theorem at a measurable cardinal

Journal of Symbolic Logic 82 (4):1560-1575 (2017)
  Copy   BIBTEX

Abstract

Several variants of the Halpern–Läuchli Theorem for trees of uncountable height are investigated. Forκweakly compact, we prove that the various statements are all equivalent, and hence, the strong tree version holds for one tree on any weakly compact cardinal. For any finited≥ 2, we prove the consistency of the Halpern–Läuchli Theorem ondmany normalκ-trees at a measurable cardinalκ, given the consistency of aκ+d-strong cardinal. This follows from a more general consistency result at measurableκ, which includes the possibility of infinitely many trees, assuming partition relations which hold in models of AD.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Weakly measurable cardinals.Jason A. Schanker - 2011 - Mathematical Logic Quarterly 57 (3):266-280.
The number of normal measures.Sy-David Friedman & Menachem Magidor - 2009 - Journal of Symbolic Logic 74 (3):1069-1080.
Forcing the Least Measurable to Violate GCH.Arthur W. Apter - 1999 - Mathematical Logic Quarterly 45 (4):551-560.
Identity crises and strong compactness.Arthur W. Apter & James Cummings - 2000 - Journal of Symbolic Logic 65 (4):1895-1910.
Eastonʼs theorem and large cardinals from the optimal hypothesis.Sy-David Friedman & Radek Honzik - 2012 - Annals of Pure and Applied Logic 163 (12):1738-1747.
Patterns of compact cardinals.Arthur W. Apter - 1997 - Annals of Pure and Applied Logic 89 (2-3):101-115.
Filters and large cardinals.Jean-Pierre Levinski - 1995 - Annals of Pure and Applied Logic 72 (2):177-212.
A gap 1 cardinal transfer theorem.Luis M. Villegas-Silva - 2006 - Mathematical Logic Quarterly 52 (4):340-350.

Analytics

Added to PP
2018-02-09

Downloads
13 (#1,010,467)

6 months
1 (#1,510,037)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The Ramsey theory of Henson graphs.Natasha Dobrinen - 2022 - Journal of Mathematical Logic 23 (1).

Add more citations

References found in this work

The Higher Infinite.Akihiro Kanamori - 2000 - Studia Logica 65 (3):443-446.
Partitions of large Rado graphs.M. Džamonja, J. A. Larson & W. J. Mitchell - 2009 - Archive for Mathematical Logic 48 (6):579-606.

Add more references