Things that can and things that cannot be done in PRA

DOI10.1016/S0168-0072(99)00036-6zbMath0958.03039MaRDI QIDQ1971796

Ulrich Kohlenbach

Publication date: 19 March 2001

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

zbMATH Keywords

primitive recursive arithmetic; Ackermann function; fragments of arithmetic; fragments of analysis

Mathematics Subject Classification ID

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

03D20: Recursive functions and relations, subrecursive hierarchies

03F10: Functionals in proof theory

03F35: Second- and higher-order arithmetic and fragments

Related Items

Quantitative results on Fejér monotone sequences, From Bolzano‐Weierstraß to Arzelà‐Ascoli, Some intuitionistic equivalents of classical principles for degree 2 formulas, The cohesive principle and the Bolzano-Weierstraß principle, On the computational content of the Bolzano-Weierstraß Principle, Transfer and a supremum principle for ERNA

Cites Work

• Fragments of arithmetic
• Handbook of proof theory
• 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
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• Partial realizations of Hilbert's program
• Effective bounds from ineffective proofs in analysis: An application of functional interpretation and majorization
• Note on the fan theorem
• On n-quantifier induction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item