The Halpern-Läuchli theorem at a measurable cardinal

DOI10.1017/JSL.2017.31MaRDI QIDQ4600470zbMATH OpenOpenAlexFDO

Authors Natasha Dobrinen, Dan Hathaway

Publication date 11 January 2018

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1608.00592

zbMATH Keywords

Halpern-Läuchli theoremmeasurable cardinalspartition relationsRamsey theory

Mathematics Subject Classification ID

Partition relations (03E02) Other combinatorial set theory (03E05) Consistency and independence results (03E35) Other aspects of forcing and Boolean-valued models (03E40) Large cardinals (03E55) Ramsey theory (05D10)

Abstract: Several variants of the Halpern-L"auchli Theorem for trees of uncountable height are investigated. For $kappa$ weakly compact, we prove that the various statements are all equivalent. We show that the strong tree version holds for one tree on any infinite cardinal. For any finite $dge2$, we prove the consistency of the Halpern-L"auchli Theorem on $d$ many $kappa$-trees at a measurable cardinal $kappa$, given the consistency of a $kappa+d$-strong cardinal. This follows from a more general consistency result at measurable $kappa$, which includes the possibility of infinitely many trees, assuming partition relations which hold in models of AD.

Recommendations

• A tail cone version of the Halpern-Läuchli theorem at a large cardinal
• Forcing and the Halpern-Läuchli theorem
• A density version of the Halpern-Läuchli theorem
• A proof of Halpern-Läuchli partition theorem
• The consistency strength of the tree property at the double successor of a measurable cardinal

Cites work

• A canonical partition theorem for uniform families of finite strong subtrees
• A partition calculus in set theory
• A Partition Theorem
• A partition theorem for a large dense linear order
• A Partition Theorem for the Infinite Subtrees of a Tree
• A Ramsey theorem for trees
• A strongly non-Ramsey order type
• Canonical equivalence relations on \(\mathbb Q^n\)
• Coloring subgraphs of the Rado graph
• Dense Subsets of Products of Finite Trees
• scientific article; zbMATH DE number 426365 (Why is no real title available?)
• scientific article; zbMATH DE number 1908324 (Why is no real title available?)
• scientific article; zbMATH DE number 3368622 (Why is no real title available?)
• Introduction to Ramsey space
• Parametrized partitions of products of finite sets
• Partitions of large Rado graphs
• Perfect trees and elementary embeddings
• Products of Infinitely Many Perfect Trees
• Rainbow Ramsey simple structures
• Ramsey Theory on Trees and Applications
• Some applications of the method of forcing
• Subsets of products of finite sets of positive upper density

Cited in

(12)

• A proof of Halpern-Läuchli partition theorem
• A note on Hindman-type theorems for uncountable cardinals
• Forcing and the Halpern-Läuchli theorem
• The Ramsey theory of the universal homogeneous triangle-free graph
• A tail cone version of the Halpern-Läuchli theorem at a large cardinal
• Ramsey Theory on Trees and Applications
• Dense Subsets of Products of Finite Trees
• The Ramsey theory of Henson graphs
• Higher-dimensional delta-systems
• Ramsey theory of homogeneous structures: current trends and open problems
• The generic multiverse is not going away
• Polish space partition principles and the Halpern-Läuchli theorem

This page was built for publication: The Halpern-Läuchli theorem at a measurable cardinal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4600470)