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

DOI10.1016/j.apal.2006.04.004zbMath1123.03043OpenAlexW1975891607MaRDI 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 theoremHardy hierarchy\(\alpha\)-large sets

Mathematics Subject Classification ID

Partitions of sets (05A18) Ramsey theory (05D10) Other combinatorial set theory (03E05) Recursive ordinals and ordinal notations (03F15)

Related Items (6)

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 ⋮ On a question of Andreas Weiermann ⋮ Phase transitions for Gödel incompleteness ⋮ Partitioning 𝛼–large sets: Some lower bounds

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

This page was built for publication: More on lower bounds for partitioning \(\alpha\)-large sets