More on lower bounds for partitioning \(\alpha\)-large sets

DOI10.1016/j.apal.2006.04.004zbMath1123.03043MaRDI QIDQ2373693

Bożena Piekart, Henryk Kotlarski, Andreas Weiermann

Publication date: 16 July 2007

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

Full work available at URL: https://doi.org/10.1016/j.apal.2006.04.004

zbMATH Keywords

Ramsey theorem; Hardy hierarchy; \(\alpha\)-large sets

Mathematics Subject Classification ID

05A18: Partitions of sets

05D10: Ramsey theory

03E05: Other combinatorial set theory

03F15: Recursive ordinals and ordinal notations

Related Items

Phase transitions for Gödel incompleteness, The proof-theoretic strength of Ramsey's theorem for pairs and two colors, Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs, Partitioning 𝛼–large sets: Some lower bounds, On a question of Andreas Weiermann

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subsystems of true arithmetic and hierarchies of functions
• Inductive full satisfaction classes
• Some bounds for the Ramsey-Paris-Harrington numbers
• Rapidly growing Ramsey functions
• Transfinite induction within Peano arithmetic
• On the strength of Ramsey's theorem for pairs
• More on induction in the language with a satisfaction class
• Partitioning 𝛼–large sets: Some lower bounds
• A combinatorial analysis of functions provably recursive in $ΙΣ_n$
• Some independence results for Peano arithmetic
• A Model-Theoretic Approach to Ordinal Analysis
• Some combinatorics involving ξ-large sets