A Partition Theorem

DOI10.2307/1994406MaRDI QIDQ5541372zbMATH OpenOpenAlexFDO

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
• Direct Decomposition of Partitions
• Teilmengen von Mengen mit Relationen

Cited in

(55)

• A dual form of Ramsey's theorem
• A Ramsey theorem for trees
• A Ramseyian theorem on products of trees
• Upper bounds for a Ramsey theorem for trees
• A proof of Halpern-Läuchli partition theorem
• On \(\vartriangleleft^{*}\)-maximality.
• Choiceless Ramsey theory of linear orders
• A collection of topological Ramsey spaces of trees and their application to profinite graph theory
• Some unifying principles in Ramsey theory
• Copies of the random graph
• On big Ramsey degrees for binary free amalgamation classes
• All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
• A density version of the Halpern-Läuchli theorem
• Unconditional families in Banach spaces
• Levy and set theory
• Big Ramsey degrees in universal inverse limit structures
• Amorphe Potenzen kompakter Räume
• Partition theorems from creatures and idempotent ultrafilters
• A Partition Theorem For Perfect Sets
• Partitions of Products
• A canonical partition theorem for uniform families of finite strong subtrees
• A Two-Cardinal Theorem and a Combinatorial Theorem
• A proof of a partition theorem for [ℚ]ⁿ
• The Halpern-Läuchli theorem at a measurable cardinal
• A density version of the Carlson-Simpson theorem
• Forcing and the Halpern-Läuchli theorem
• The Ramsey theory of the universal homogeneous triangle-free graph
• A Sacks amoeba preserving distributivity of $\mathcal {P}(\omega )/\mathrm {fin}$
• A tail cone version of the Halpern-Läuchli theorem at a large cardinal
• Ramsey Theory on Trees and Applications
• Ramsey families of subtrees of the dyadic tree
• Banach spaces and Ramsey theory: some open problems
• The Ramsey theory of Henson graphs
• Laver and set theory
• HL ideals and Sacks indestructible ultrafilters
• Alternatives to the Halpern-Läuchli theorem
• Ramsey theory of homogeneous structures: current trends and open problems
• Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective
• Bounds on trees
• Notions around tree property 1
• The Ginsburg-Sands theorem and computability theory
• Mycielski ideals and uniform trees
• Gruff ultrafilters and the ideal of scattered sets
• Borel sets of Rado graphs and Ramsey's theorem
• Borel partitions of infinite subtrees of a perfect tree
• The method of forcing
• The generic multiverse is not going away
• Big Ramsey degrees using parameter spaces
• Type-respecting amalgamation and big Ramsey degrees (extended abstract)
• Universally Sacks-indestructible combinatorial families of reals
• Polish space partition principles and the Halpern-Läuchli theorem
• Parametrizing the Ramsey theory of vector spaces. I: Discrete spaces
• Density theorems for finitistic trees
• A partition theorem for a large dense linear order
• A disjoint unions theorem for 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)