A Partition Theorem

DOI10.2307/1994406zbMATH Open0158.26902OpenAlexW4232003977MaRDI QIDQ5541372FDOQ5541372

Authors: J. D. Halpern, Hans Läuchli 

Publication date: 1966

Full work available at URL: https://doi.org/10.2307/1994406

zbMATH Keywords

set theory

Cites Work

• A partition calculus in set theory
• Teilmengen von Mengen mit Relationen
• Direct Decomposition of Partitions

Cited In (46)

• Notions around tree property 1
• The Ramsey theory of Henson graphs
• A canonical partition theorem for uniform families of finite strong subtrees
• A partition theorem for a large dense linear order
• FORCING AND THE HALPERN–LÄUCHLI THEOREM
• Ramsey families of subtrees of the dyadic tree
• A Ramsey theorem for trees
• Borel partitions of infinite subtrees of a perfect tree
• Upper bounds for a Ramsey theorem for trees
• Levy and set theory
• A collection of topological Ramsey spaces of trees and their application to profinite graph theory
• All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
• A dual form of Ramsey's theorem
• A density version of the Halpern-Läuchli theorem
• Amorphe Potenzen kompakter Räume
• A density version of the Carlson-Simpson theorem
• A disjoint unions theorem for trees
• Partitions of Products
• A Two-Cardinal Theorem and a Combinatorial Theorem
• HL ideals and Sacks indestructible ultrafilters
• Some unifying principles in Ramsey theory
• A Sacks amoeba preserving distributivity of $\mathcal {P}(\omega )/\mathrm {fin}$
• Banach spaces and Ramsey theory: some open problems
• Partition theorems from creatures and idempotent ultrafilters
• Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective
• On \(\vartriangleleft^{*}\)-maximality.
• A Ramseyian theorem on products of trees
• Unconditional families in Banach spaces
• THE HALPERN–LÄUCHLI THEOREM AT A MEASURABLE CARDINAL
• Ramsey Theory on Trees and Applications
• On big Ramsey degrees for binary free amalgamation classes
• Density theorems for finitistic trees
• A proof of a partition theorem for [ℚ]ⁿ
• The Ginsburg-Sands theorem and computability theory
• Bounds on trees
• Choiceless Ramsey theory of linear orders
• A Partition Theorem For Perfect Sets
• A proof of Halpern-Läuchli partition theorem
• A TAIL CONE VERSION OF THE HALPERN–LÄUCHLI THEOREM AT A LARGE CARDINAL
• Copies of the random graph
• Alternatives to the Halpern-Läuchli theorem
• The Ramsey theory of the universal homogeneous triangle-free graph
• Laver and set theory
• Big Ramsey degrees in universal inverse limit structures
• Ramsey theory of homogeneous structures: current trends and open problems
• Mycielski ideals and uniform trees

This page was built for publication: A Partition Theorem

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