A short proof of a partition theorem for the ordinal ωω
From MaRDI portal
Publication:5183500
DOI10.1016/0003-4843(73)90006-5zbMath0275.04003OpenAlexW2090465125MaRDI QIDQ5183500
Publication date: 1973
Published in: Annals of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0003-4843(73)90006-5
Combinatorial aspects of partitions of integers (05A17) Large cardinals (03E55) Other combinatorial set theory (03E05) Ordinal and cardinal numbers (03E10)
Related Items (11)
Formalizing Ordinal Partition Relations Using Isabelle/HOL ⋮ A partition theorem for ordinals ⋮ Choiceless Ramsey theory of linear orders ⋮ A formalised theorem in the partition calculus ⋮ Large-scale formal proof for the working mathematician -- lessons learnt from the ALEXANDRIA project ⋮ A counter-example in the partition calculus for an uncountable ordinal ⋮ Countable partition ordinals ⋮ Partition relations for uncountable ordinals ⋮ The quasi order of graphs on an ordinal ⋮ Negative partition relations for ordinals \(\omega^{\omega^\alpha}\) ⋮ Idiosynchromatic poetry
This page was built for publication: A short proof of a partition theorem for the ordinal ωω