Proof theoretic complexity of low subrecursive classes

zbMATH Open0985.03050MaRDI QIDQ2752056FDOQ2752056

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

Publication date: 7 March 2002

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

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)

Cited In (9)

• Complexity of subclasses of the intuitionistic propositional calculus
• New Computational Paradigms
• Title not available (Why is that?)
• Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs
• Title not available (Why is that?)
• Elementary arithmetic
• Recursion and proofs
• Title not available (Why is that?)
• A hierarchy of ramified theories below PRA

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)