Recursion and proofs

MaRDI QIDQ5435640zbMATH OpenFDO

Authors Stanley S. Wainer

Publication date 14 January 2008

zbMATH Keywords

complexity classescomputational complexitylogical complexityproof theoryrecursion theorytutorial

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Complexity of proofs (03F20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 1342252
• scientific article; zbMATH DE number 785053
• scientific article; zbMATH DE number 2222029
• Proof theoretic complexity of low subrecursive classes
• scientific article; zbMATH DE number 218515

Cited in

(9)

• A slow growing analogue to Buchholz' proof
• Elementary descent recursion and proof theory
• Recursive proof composition from accumulation schemes
• scientific article; zbMATH DE number 434733 (Why is no real title available?)
• scientific article; zbMATH DE number 1342252 (Why is no real title available?)
• scientific article; zbMATH DE number 841086 (Why is no real title available?)
• Recursive Functions and Constructive Mathematics
• scientific article; zbMATH DE number 2222029 (Why is no real title available?)
• New Computational Paradigms

This page was built for publication: Recursion and proofs

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