Induction rules, reflection principles, and provably recursive functions
From MaRDI portal
Publication:1361250
Recommendations
Cites work
- scientific article; zbMATH DE number 3857078 (Why is no real title available?)
- scientific article; zbMATH DE number 3668596 (Why is no real title available?)
- scientific article; zbMATH DE number 3784875 (Why is no real title available?)
- scientific article; zbMATH DE number 1555192 (Why is no real title available?)
- scientific article; zbMATH DE number 227056 (Why is no real title available?)
- scientific article; zbMATH DE number 3247155 (Why is no real title available?)
- scientific article; zbMATH DE number 3320380 (Why is no real title available?)
- scientific article; zbMATH DE number 3353255 (Why is no real title available?)
- Fragments of arithmetic
- Herbrand analyses
- Hierarchies of Primitive Recursive Functions
- Induction rules, reflection principles, and provably recursive functions
- On n-quantifier induction
- On the scheme of induction for bounded arithmetic formulas
- Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
- Reflection Principles in Fragments of Peano Arithmetic
- Rekursionszahlen und die Grzegorczyk-Hierarchie
- The optimality of induction as an axiomatization of arithmetic
Cited in
(34)- Arithmetical interpretations and Kripke frames of predicate modal logic of provability
- scientific article; zbMATH DE number 1966617 (Why is no real title available?)
- On the induction schema for decidable predicates
- Interpretability in PRA
- Induction rules, reflection principles, and provably recursive functions
- Computer Science Logic
- Fragments of Arithmetic and true sentences
- The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\)
- Unprovability results for clause set cycles
- Local induction and provably total computable functions
- Hyperarithmetical worm battles
- scientific article; zbMATH DE number 3948262 (Why is no real title available?)
- AXIOMATIZATION OF PROVABLE n-PROVABILITY
- Some results on cut-elimination, provable well-orderings, induction and reflection
- Provably recursive functions of reflection
- A note on the \(\Pi_ 2^ 0\)-induction rule
- PREDICATIVITY THROUGH TRANSFINITE REFLECTION
- Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA
- Elementary descent recursion and proof theory
- On axiom schemes for \(T\)-provably \(\Delta_1\) formulas
- MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE
- Parameter free induction and provably total computable functions
- Semi-honest subrecursive degrees and the collection rule in arithmetic
- Honest elementary degrees and degrees of relative provability without the cupping property
- A note on fragments of uniform reflection in second order arithmetic
- Provability algebras and proof-theoretic ordinals. I
- scientific article; zbMATH DE number 1088194 (Why is no real title available?)
- ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS
- Induction rules in bounded arithmetic
- Functions provably total in $I^{-}Σ_{n}$
- On nested simple recursion
- Proof theoretic analysis by iterated reflection
- Local induction and provably total computable functions: a case study
- AN INCOMPLETENESS THEOREM VIA ORDINAL ANALYSIS
This page was built for publication: Induction rules, reflection principles, and provably recursive functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361250)
