Partitioning 𝛼–large sets: Some lower bounds
From MaRDI portal
Publication:3420352
DOI10.1090/S0002-9947-06-03883-9zbMath1107.05006OpenAlexW1542740106MaRDI QIDQ3420352
Teresa Bigorajska, Henryk Kotlarski
Publication date: 1 February 2007
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9947-06-03883-9
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 ⋮ Some variations of the Hardy hierarchy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subsystems of true arithmetic and hierarchies of functions
- Inductive full satisfaction classes
- Classifying the phase transition threshold for Ackermannian functions
- Rapidly growing Ramsey functions
- Ordinal complexity of recursive definitions
- Set theory. With an introduction to descriptive set theory. Translation of the original Polish edition. 2nd, completely revised ed
- Transfinite induction within Peano arithmetic
- More on lower bounds for partitioning \(\alpha\)-large sets
- On the strength of Ramsey's theorem for pairs
- More on induction in the language with a satisfaction class
- A combinatorial analysis of functions provably recursive in $ΙΣ_n$
- An Unprovable Ramsey-Type Theorem
- A Uniform Approach to Fundamental Sequences and Hierarchies
- A Model-Theoretic Approach to Ordinal Analysis
- A classification of rapidly growing Ramsey functions
- A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
- Some combinatorics involving ξ-large sets
- Some variations of the Hardy hierarchy
This page was built for publication: Partitioning 𝛼–large sets: Some lower bounds
