Ramsey's theorem for pairs and provably recursive functions

DOI10.1215/00294527-2009-019zbMATH Open1221.03059OpenAlexW2130233653MaRDI QIDQ987936FDOQ987936

Authors: Ulrich Kohlenbach, Alexander P. Kreuzer 

Publication date: 2 September 2010

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1215/00294527-2009-019

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

zbMATH Keywords

proof miningRamsey's theorem for pairsprovably recursive functions

Mathematics Subject Classification ID

Ramsey theory (05D10) Second- and higher-order arithmetic and fragments (03F35) Functionals in proof theory (03F10)

Cited In (13)

• Ramsey type theorems for real functions
• On the uniform computational content of Ramsey's theorem
• Using Ramsey's theorem once
• 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
• Term extraction and Ramsey's theorem for pairs
• An intuitionistic version of Ramsey's theorem and its use in program termination
• Is Ramsey's theorem omega-automatic?
• Proof mining and combinatorics. Program extraction for Ramsey's theorem for pairs
• The proof-theoretic strength of Ramsey's theorem for pairs and two colors
• A constructive interpretation of Ramsey's theorem via the product of selection functions
• The inductive strength of Ramsey's theorem for pairs
• 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)