Local induction and provably total computable functions

DOI10.1016/j.apal.2014.04.012zbMath1316.03037OpenAlexW1999275823MaRDI QIDQ2453069

F. F. Lara-Martín, 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

first-order arithmeticprimitive recursive functionsconservation resultsparameter-free induction

Mathematics Subject Classification ID

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

Related Items (1)

Induction rules in bounded arithmetic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Induction, minimization and collection for \(\Delta_{n+1}(T)\)-formulas
• A proof-theoretic analysis of collection
• Induction rules, reflection principles, and provably recursive functions
• Saturated models of universal theories
• Parameter free induction and provably total computable functions
• Herbrand analyses
• On parameter free induction schemas
• Notes on polynomially bounded arithmetic
• Functions provably total in $I^{-}Σ_{n}$

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