Term extraction and Ramsey's theorem for pairs
From MaRDI portal
Publication:2915896
DOI10.2178/jsl/1344862165zbMath1254.03112OpenAlexW2069207426MaRDI QIDQ2915896
Alexander P. Kreuzer, Ulrich Kohlenbach
Publication date: 19 September 2012
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.jsl/1344862165
Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Functionals in proof theory (03F10) Second- and higher-order arithmetic and fragments (03F35)
Related Items
Measure theory and higher order arithmetic ⋮ Program extraction for 2-random reals ⋮ ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM ⋮ Primitive recursion and the chain antichain principle ⋮ From Bolzano‐Weierstraß to Arzelà‐Ascoli ⋮ On uniform relationships between combinatorial problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primitive recursion and the chain antichain principle
- \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
- Ramsey's theorem for pairs and provably recursive functions
- Recursion on the countable functionals
- Elimination of Skolem functions for monotone formulas in analysis
- On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness
- Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals
- On the strength of Ramsey's theorem
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- The strength of infinitary Ramseyan principles can be accessed by their densities
- Extensional Gödel functional interpretation. A consistency proof of classical analysis
- On the strength of Ramsey's theorem for pairs
- The cohesive principle and the Bolzano-Weierstraß principle
- On the computational content of the Bolzano-Weierstraß Principle
- Reverse Mathematics: The Playground of Logic
- Recursive Functionals and Quantifiers of Finite Types I
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- Shoenfield is Gödel after Krivine
- Corrigendum to: “On the strength of Ramsey's Theorem for pairs”
- Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals
- Ordinal analysis of terms of finite type
- Ordinal analysis of simple cases of bar recursion
- Effective bounds from ineffective proofs in analysis: An application of functional interpretation and majorization
- Note on the fan theorem
- Two Applications of Logic to Mathematics
- How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
- A cohesive set which is not high
- Forcing in Proof Theory
- On the No-Counterexample Interpretation
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- ∏ 0 1 Classes and Degrees of Theories
- Ramsey's theorem and recursion theory
- On n-quantifier induction
- On uniform weak König's lemma
