Erdős-Moser and I _2
From MaRDI portal
Publication:6635147
Recommendations
Cites work
- scientific article; zbMATH DE number 3700836 (Why is no real title available?)
- scientific article; zbMATH DE number 1144041 (Why is no real title available?)
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- How incomputable is finding Nash equilibria?
- Iterative forcing and hyperimmunity in reverse mathematics
- On \(\Pi^1_1\) conservativity for \(\Pi^1_2\) theories in second order arithmetic
- On principles between \(\Sigma_1\)- and \(\Sigma_2\)-induction, and monotone enumerations
- On the (semi)lattices induced by continuous reducibilities
- On the Ramseyan factorization theorem
- On the role of the collection principle for \(\Sigma ^0_2\)-formulas in second-order reverse mathematics
- On the strength of Ramsey's theorem for pairs
- On uniform relationships between combinatorial problems
- Primitive recursion and the chain antichain principle
- Ramsey-like theorems and moduli of computation
- Rapidly growing Ramsey functions
- Separating principles below Ramsey's theorem for pairs
- Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
- The definability strength of combinatorial principles
- The metamathematics of Stable Ramsey’s Theorem for Pairs
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors
- The strength of Ramsey's theorem for pairs and arbitrarily many colors
- The strength of infinitary Ramseyan principles can be accessed by their densities
- \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models
- \(\mathsf{RT}_{2}^{2}\) does not imply \(\mathsf{WKL}_{0}\)
- Σ_{𝑛}-bounding and Δ_{𝑛}-induction
This page was built for publication: Erdős-Moser and \(I \Sigma_2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635147)
