Some higher-gap examples in combinatorial set theory

DOI10.1016/0168-0072(87)90084-4zbMath0646.03046OpenAlexW1980692262MaRDI QIDQ1103617

Péter Komjáth, Andras Hajnal

Publication date: 1987

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(87)90084-4

zbMATH Keywords

forcingset mappingnegative partition relationMahlo cardinalcardinal collapsingconsistency of combinatorial statementsRamsey games

Mathematics Subject Classification ID

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

Related Items (1)

Partitioning pairs of countable ordinals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial set theory: Partition relations for cardinals
• Aronszajn trees and partitions
• Partitioning pairs of countable ordinals
• On the structure of set-mappings
• Some results and problems on set theory
• Ramsey Games
• Trees, subtrees and order types
• More on the free subset problem

This page was built for publication: Some higher-gap examples in combinatorial set theory