Provably total primitive recursive functions: Theories with induction
From MaRDI portal
Recommendations
- Parameter free induction and provably total computable functions
- Induction rules, reflection principles, and provably recursive functions
- Local induction and provably total computable functions
- Local induction and provably total computable functions: a case study
- scientific article; zbMATH DE number 1889701
Cited in
(14)- Induction rules, reflection principles, and provably recursive functions
- Characterizing the elementary recursive functions by a fragment of Gödel's \(T\)
- Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion
- Parameter free induction and provably total computable functions
- On axiom schemes for \(T\)-provably \(\Delta_1\) formulas
- Local induction and provably total computable functions
- Local induction and provably total computable functions: a case study
- Classifying the Provably Total Functions of PA
- A proof-theoretic characterization of the primitive recursive set functions
- Enumerable classes of total recursive functions: Complexity of inductive inference
- Provably total functions of Basic Arithmetic
- scientific article; zbMATH DE number 3310899 (Why is no real title available?)
- Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive -rule
- Semi-honest subrecursive degrees and the collection rule in arithmetic
This page was built for publication: Provably total primitive recursive functions: Theories with induction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311268)