On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness

DOI10.1016/S0168-0072(98)00018-9zbMath0945.03088OpenAlexW2093222212MaRDI QIDQ1295420

Ulrich Kohlenbach

Publication date: 8 October 2000

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(98)00018-9

zbMATH Keywords

choicearithmetical comprehensionarithmetic equivalents of higher-order systemsgeneral uniform boundednessKalmar-elementary arithmetic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Functionals in proof theory (03F10) Second- and higher-order arithmetic and fragments (03F35) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (5)

Term extraction and Ramsey's theorem for pairs ⋮ The finitary content of sunny nonexpansive retractions ⋮ Things that can and things that cannot be done in PRA ⋮ On the computational content of the Bolzano-Weierstraß Principle ⋮ Metastability of the proximal point algorithm with multi-parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fragments of arithmetic
• Pointwise hereditary majorization and some applications
• On some formalized conservation results in arithmetic
• Elimination of Skolem functions for monotone formulas in analysis
• Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals
• Proof-theoretic analysis by iterated reflection
• A note on the \(\Pi_ 2^ 0\)-induction rule
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• Extensional Gödel functional interpretation. A consistency proof of classical analysis
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals
• Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?
• On the No-Counterexample Interpretation
• On n-quantifier induction

This page was built for publication: On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness