Local induction and provably total computable functions: a case study

DOI10.1007/978-3-642-30870-3_45MaRDI QIDQ2904439zbMATH OpenOpenAlexFDO

Authors Andrés Cordón-Franco, F. Félix Lara Martin

Publication date 14 August 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-30870-3_45

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Recursive functions and relations, subrecursive hierarchies (03D20) First-order arithmetic and fragments (03F30)

Recommendations

• Local induction and provably total computable functions
• Induction rules, reflection principles, and provably recursive functions
• Parameter free induction and provably total computable functions
• A simple proof of Parsons' theorem
• Computer Science Logic

Cited in

(6)

• A note on the \(\Pi_ 2^ 0\)-induction rule
• Parameter free induction and provably total computable functions
• Local induction and provably total computable functions
• ON THE LOCAL-INDICABILITY COHEN–LYNDON THEOREM
• Computer Science Logic
• An interpretation of Shenoy and Shafer's axioms for local computation

This page was built for publication: Local induction and provably total computable functions: a case study

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