Some combinatorics involving ξ-large sets
From MaRDI portal
Publication:4790189
DOI10.4064/fm175-2-2zbMath1010.05006OpenAlexW2049321566MaRDI QIDQ4790189
Henryk Kotlarski, Teresa Bigorajska
Publication date: 28 January 2003
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/fm175-2-2
Partitions of sets (05A18) Ramsey theory (05D10) Other combinatorial set theory (03E05) Recursive ordinals and ordinal notations (03F15)
Related Items (5)
More on lower bounds for partitioning \(\alpha\)-large sets ⋮ The proof-theoretic strength of Ramsey's theorem for pairs and two colors ⋮ The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem ⋮ Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs ⋮ Partitioning 𝛼–large sets: Some lower bounds
This page was built for publication: Some combinatorics involving ξ-large sets