A strongly non-Ramsey order type

DOI10.1007/BF01215918zbMath0902.03032OpenAlexW174896486MaRDI QIDQ1271912

Andras Hajnal, Péter Komjáth

Publication date: 22 November 1998

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01215918

zbMATH Keywords

consistencyforcingorder typeCohen realSouslin hypothesissquare bracket relation

Mathematics Subject Classification ID

Consistency and independence results (03E35) Other combinatorial set theory (03E05)

Related Items (4)

A partition theorem for a large dense linear order ⋮ FORCING AND THE HALPERN–LÄUCHLI THEOREM ⋮ THE HALPERN–LÄUCHLI THEOREM AT A MEASURABLE CARDINAL ⋮ A TAIL CONE VERSION OF THE HALPERN–LÄUCHLI THEOREM AT A LARGE CARDINAL

Cites Work

• Combinatorial set theory: Partition relations for cardinals
• Can you take Solovay's inaccessible away?

This page was built for publication: A strongly non-Ramsey order type