Ramsey's theorem for pairs and provably recursive functions
From MaRDI portal
(Redirected from Publication:987936)
Recommendations
- On the strength of Ramsey's theorem
- Proof mining and combinatorics. Program extraction for Ramsey's theorem for pairs
- The inductive strength of Ramsey's theorem for pairs
- The metamathematics of Stable Ramsey’s Theorem for Pairs
- On the strength of Ramsey's theorem without \(\Sigma _{1}\)-induction
- Ramsey's theorem for pairs and \(k\) colors as a sub-classical principle of arithmetic
- Ramsey theorem for pairs as a classical principle in intuitionistic arithmetic
- Coloring trees in reverse mathematics
- On the strength of Ramsey's theorem for pairs
- Term extraction and Ramsey's theorem for pairs
Cited in
(13)- On the strength of Ramsey's theorem without \(\Sigma _{1}\)-induction
- An intuitionistic version of Ramsey's theorem and its use in program termination
- Ramsey type theorems for real functions
- Using Ramsey's theorem once
- Term extraction and Ramsey's theorem for pairs
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors
- Ramsey's theorem for pairs and \(k\) colors as a sub-classical principle of arithmetic
- Proof mining and combinatorics. Program extraction for Ramsey's theorem for pairs
- A constructive interpretation of Ramsey's theorem via the product of selection functions
- The inductive strength of Ramsey's theorem for pairs
- Is Ramsey's theorem omega-automatic?
- On the uniform computational content of Ramsey's theorem
- A note on the finitization of Abelian and Tauberian theorems
This page was built for publication: Ramsey's theorem for pairs and provably recursive functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987936)
