Proof theoretic complexity of low subrecursive classes

MaRDI QIDQ2752056zbMATH OpenFDO

Authors Naim Çağman, Geoffrey E. Ostrin, Stanley S. Wainer

Publication date 7 March 2002

zbMATH Keywords

provably recursive functionsGrzegorczyk hierarchyslow-growing bounding functionstwo-sorted Peano arithmetic

Mathematics Subject Classification ID

Complexity of proofs (03F20) First-order arithmetic and fragments (03F30) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• Elementary arithmetic
• scientific article; zbMATH DE number 2110622
• New Computational Paradigms
• A hierarchy of ramified theories below PRA
• scientific article; zbMATH DE number 1215495

Cited in

(9)

• A hierarchy of ramified theories below PRA
• Complexity of subclasses of the intuitionistic propositional calculus
• New Computational Paradigms
• scientific article; zbMATH DE number 1342223 (Why is no real title available?)
• Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs
• Elementary arithmetic
• scientific article; zbMATH DE number 2222029 (Why is no real title available?)
• Recursion and proofs
• scientific article; zbMATH DE number 2110622 (Why is no real title available?)

This page was built for publication: Proof theoretic complexity of low subrecursive classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2752056)