THE HALPERN–LÄUCHLI THEOREM AT A MEASURABLE CARDINAL
From MaRDI portal
Publication:4600470
DOI10.1017/jsl.2017.31zbMath1421.03022arXiv1608.00592OpenAlexW2964040109MaRDI QIDQ4600470
Natasha Dobrinen, Dan Hathaway
Publication date: 11 January 2018
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.00592
Consistency and independence results (03E35) Large cardinals (03E55) Ramsey theory (05D10) Other combinatorial set theory (03E05) Partition relations (03E02) Other aspects of forcing and Boolean-valued models (03E40)
Related Items (7)
The Ramsey theory of Henson graphs ⋮ FORCING AND THE HALPERN–LÄUCHLI THEOREM ⋮ Higher-dimensional delta-systems ⋮ Ramsey theory of homogeneous structures: current trends and open problems ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A canonical partition theorem for uniform families of finite strong subtrees
- Parametrized partitions of products of finite sets
- Partitions of large Rado graphs
- A partition theorem for a large dense linear order
- Coloring subgraphs of the Rado graph
- A Ramsey theorem for trees
- A strongly non-Ramsey order type
- Subsets of products of finite sets of positive upper density
- Canonical equivalence relations on \(\mathbb Q^n\)
- Rainbow Ramsey simple structures
- A partition calculus in set theory
- Introduction to Ramsey Spaces (AM-174)
- Perfect trees and elementary embeddings
- Products of Infinitely Many Perfect Trees
- A Partition Theorem for the Infinite Subtrees of a Tree
- Ramsey Theory on Trees and Applications
- Dense Subsets of Products of Finite Trees
- A Partition Theorem
This page was built for publication: THE HALPERN–LÄUCHLI THEOREM AT A MEASURABLE CARDINAL
