More on lower bounds for partitioning -large sets

DOI10.1016/J.APAL.2006.04.004MaRDI QIDQ2373693zbMATH OpenOpenAlexFDO

Authors Henryk Kotlarski, Bożena Piekart, 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

\(\alpha\)-large setsHardy hierarchyRamsey theorem

Mathematics Subject Classification ID

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

Recommendations

• Partitioning 𝛼–large sets: Some lower bounds
• Some bounds for the Ramsey-Paris-Harrington numbers
• On the proof complexity of Paris-Harrington and off-diagonal Ramsey tautologies
• scientific article; zbMATH DE number 1356031
• An Unprovable Ramsey-Type Theorem

Cites work

• A combinatorial analysis of functions provably recursive in ΙΣ_n
• A Model-Theoretic Approach to Ordinal Analysis
• scientific article; zbMATH DE number 3825795 (Why is no real title available?)
• scientific article; zbMATH DE number 46958 (Why is no real title available?)
• scientific article; zbMATH DE number 3578859 (Why is no real title available?)
• scientific article; zbMATH DE number 1356031 (Why is no real title available?)
• scientific article; zbMATH DE number 3351518 (Why is no real title available?)
• Inductive full satisfaction classes
• More on induction in the language with a satisfaction class
• On the strength of Ramsey's theorem for pairs
• Partitioning 𝛼–large sets: Some lower bounds
• Rapidly growing Ramsey functions
• Some bounds for the Ramsey-Paris-Harrington numbers
• Some combinatorics involving ξ-large sets
• Some independence results for Peano arithmetic
• Subsystems of second order arithmetic
• Subsystems of true arithmetic and hierarchies of functions
• Transfinite induction within Peano arithmetic

Cited in

(7)

• 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
• scientific article; zbMATH DE number 1356031 (Why is no real title available?)
• The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373693)