Pages that link to "Item:Q987936"

The following pages link to Ramsey's theorem for pairs and provably recursive functions (Q987936):

Displaying 13 items.

• An intuitionistic version of Ramsey's theorem and its use in program termination (Q499082) (← links)
• The inductive strength of Ramsey's theorem for pairs (Q507201) (← links)
• The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984) (← links)
• On the strength of Ramsey's theorem (Q1913632) (← links)
• Using Ramsey's theorem once (Q2274133) (← links)
• Proof mining and combinatorics. Program extraction for Ramsey's theorem for pairs (Q2898881) (← links)
• Term extraction and Ramsey's theorem for pairs (Q2915896) (← links)
• Is Ramsey's theorem omega-automatic? (Q3113778) (← links)
• Ramsey type theorems for real functions (Q3810035) (← links)
• ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM (Q4600456) (← links)
• RAMSEY’S THEOREM FOR PAIRS AND<i>K</i>COLORS AS A SUB-CLASSICAL PRINCIPLE OF ARITHMETIC (Q4977228) (← links)
• A constructive interpretation of Ramsey's theorem via the product of selection functions (Q5740680) (← links)
• A note on the finitization of Abelian and Tauberian theorems (Q6096323) (← links)