FORCING AND THE HALPERN–LÄUCHLI THEOREM

DOI10.1017/jsl.2019.59zbMath1477.03175arXiv1706.08174OpenAlexW2972705334MaRDI QIDQ5107220

Natasha Dobrinen, Daniel Hathaway

Publication date: 17 April 2020

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

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

zbMATH Keywords

forcingRamsey theorylarge cardinalsgeneric absolutenesspartition relationsinfinitary combinatorics

Mathematics Subject Classification ID

Consistency and independence results (03E35) Large cardinals (03E55) Ramsey theory (05D10) Other combinatorial set theory (03E05) Partition relations (03E02) Generic absoluteness and forcing axioms (03E57)

Related Items

The Ramsey theory of Henson graphs, Ramsey theory of homogeneous structures: current trends and open problems

Cites Work

• Unnamed Item
• Unnamed Item
• Partitions of large Rado graphs
• A partition theorem for a large dense linear order
• Canonical partitions of universal structures
• Coloring subgraphs of the Rado graph
• A Ramsey theorem for trees
• A strongly non-Ramsey order type
• Ramsey Theory for Product Spaces
• Introduction to Ramsey Spaces (AM-174)
• Products of Infinitely Many Perfect Trees
• Small forcing makes any cardinal superdestructible
• THE HALPERN–LÄUCHLI THEOREM AT A MEASURABLE CARDINAL
• A TAIL CONE VERSION OF THE HALPERN–LÄUCHLI THEOREM AT A LARGE CARDINAL
• A Partition Theorem