Parameter free induction and provably total computable functions
From MaRDI portal
Publication:1960416
DOI10.1016/S0304-3975(98)00305-3zbMath0930.03082MaRDI QIDQ1960416
Publication date: 12 January 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
provability logicreflection principlesfast growing hierarchyKalmar elementary arithmeticparameter free inductionprovably total computable functions
Logic in computer science (03B70) First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)
Related Items
A NOTE ON FRAGMENTS OF UNIFORM REFLECTION IN SECOND ORDER ARITHMETIC, Reverse mathematical bounds for the termination theorem, Local reflection, definable elements and 1-provability, Local induction and provably total computable functions, Axiomatizing provable \(n\)-provability, Proof Theoretic Analysis by Iterated Reflection, Coinduction in Flow: The Later Modality in Fibrations, Explicit Provability and Constructive Semantics, Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories, 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10, Fragments of Arithmetic and true sentences, AXIOMATIZATION OF PROVABLE n-PROVABILITY, Induction rules in bounded arithmetic, A note on parameter free Π1 -induction and restricted exponentiation, On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories, Unprovability results for clause set cycles
Cites Work
- Self-reference and modal logic
- On the scheme of induction for bounded arithmetic formulas
- Induction rules, reflection principles, and provably recursive functions
- Proof-theoretic analysis by iterated reflection
- Iterated local reflection versus iterated consistency
- Transfinite induction within Peano arithmetic
- Reflection principles and provability algebras in formal arithmetic
- The optimality of induction as an axiomatization of arithmetic
- Reflection Principles in Fragments of Peano Arithmetic
- Parameter-Free Universal Induction
- On parameter free induction schemas
- On Σ1‐definable Functions Provably Total in I ∏
- Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
- Hierarchies of number-theoretic functions II
- On n-quantifier induction
- Functions provably total in $I^{-}Σ_{n}$
- Functions provably total in $I^{-}Σ_{n}$
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
