A proof of Halpern-Läuchli partition theorem

DOI10.1006/EUJC.2001.0542MaRDI QIDQ1348762zbMATH OpenOpenAlexFDO

Authors V. Felouzis, Spiros A. Argyros, Vassilis Kanellopoulos

Publication date 17 November 2002

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/eujc.2001.0542

zbMATH Keywords

Halpern-Läuchli partition theorempartitions of finite products of trees

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Partitions of sets (05A18) Trees (05C05)

Review text

This paper deals with the Halpern-Läuchli theorem which is a fundamental Ramsey type principle dealing with partitions of finite products of trees. The authors here present a proof of the Halpern-Läuchli partition theorem and its version for strong subtrees by proving a general statement of which these results of interest are an immediate consequence. The earlier proof uses some metamathematical tools which are difficult to follow, but the proof presented here avoids all those metamathematical arguments. This paper also includes some additional applications of this theorem in the area of metric spaces.

Recommendations

• The Halpern-Läuchli theorem at a measurable cardinal
• A density version of the Halpern-Läuchli theorem
• A tail cone version of the Halpern-Läuchli theorem at a large cardinal
• Forcing and the Halpern-Läuchli theorem
• Borel partitions of infinite subtrees of a perfect tree

Cites work

• A Partition Theorem
• A Ramsey theorem for trees
• Borel partitions of infinite subtrees of a perfect tree
• Nonstandard Combinatorics
• Partitions of Products

Cited in

(11)

• Proof of a conjecture on partitions of a Boolean lattice
• Unconditional families in Banach spaces
• A proof of a partition theorem for [ℚ]ⁿ
• The Halpern-Läuchli theorem at a measurable cardinal
• Forcing and the Halpern-Läuchli theorem
• A tail cone version of the Halpern-Läuchli theorem at a large cardinal
• Dense Subsets of Products of Finite Trees
• Ramsey families of subtrees of the dyadic tree
• Bounds on trees
• Borel partitions of infinite subtrees of a perfect tree
• A disjoint unions theorem for trees

This page was built for publication: A proof of Halpern-Läuchli partition theorem

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