Local induction and provably total computable functions

DOI10.1016/J.APAL.2014.04.012MaRDI QIDQ2453069zbMATH OpenOpenAlexFDO

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

Publication date 6 June 2014

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

Full work available at URL https://doi.org/10.1016/j.apal.2014.04.012

zbMATH Keywords

primitive recursive functionsfirst-order arithmeticconservation resultsparameter-free induction

Mathematics Subject Classification ID

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

Recommendations

• Local induction and provably total computable functions: a case study
• Parameter free induction and provably total computable functions
• Induction rules, reflection principles, and provably recursive functions
• Computer Science Logic
• Functions provably total in $I^{-}Σ_{n}$

Cites work

• scientific article; zbMATH DE number 3857078 (Why is no real title available?)
• scientific article; zbMATH DE number 733384 (Why is no real title available?)
• scientific article; zbMATH DE number 227056 (Why is no real title available?)
• A proof-theoretic analysis of collection
• Conservation results for parameter-free \(\Pi_n\)-induction
• Functions provably total in $I^{-}Σ_{n}$
• Herbrand analyses
• Induction rules, reflection principles, and provably recursive functions
• Induction, minimization and collection for \(\Delta_{n+1}(T)\)-formulas
• Notes on polynomially bounded arithmetic
• On parameter free induction schemas
• Parameter free induction and provably total computable functions
• Saturated models of universal theories

Cited in

(14)

• Functions provably total in $I^{-}Σ_{n}$
• A simple proof of Parsons' theorem
• ON THE LOCAL-INDICABILITY COHEN–LYNDON THEOREM
• On Σ₁‐definable Functions Provably Total in I ∏
• MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE
• Computer Science Logic
• An interpretation of Shenoy and Shafer's axioms for local computation
• On the induction schema for decidable predicates
• Provably total functions of Basic Arithmetic
• On axiom schemes for \(T\)-provably \(\Delta_1\) formulas
• Parameter free induction and provably total computable functions
• On the optimality of conservation results for local reflection in arithmetic
• Local induction and provably total computable functions: a case study
• Induction rules in bounded arithmetic

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

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