Ramsey's theorem for pairs and provably recursive functions

DOI10.1215/00294527-2009-019zbMath1221.03059OpenAlexW2130233653MaRDI QIDQ987936

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

zbMATH Keywords

proof miningRamsey's theorem for pairsprovably recursive functions

Mathematics Subject Classification ID

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

Related Items (7)

The proof-theoretic strength of Ramsey's theorem for pairs and two colors ⋮ Term extraction and Ramsey's theorem for pairs ⋮ A note on the finitization of Abelian and Tauberian theorems ⋮ ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM ⋮ An intuitionistic version of Ramsey's theorem and its use in program termination ⋮ A constructive interpretation of Ramsey's theorem via the product of selection functions ⋮ RAMSEY’S THEOREM FOR PAIRS ANDKCOLORS AS A SUB-CLASSICAL PRINCIPLE OF ARITHMETIC

This page was built for publication: Ramsey's theorem for pairs and provably recursive functions