Induction rules, reflection principles, and provably recursive functions

DOI10.1016/S0168-0072(96)00045-0zbMATH Open0882.03055OpenAlexW2076792546MaRDI QIDQ1361250FDOQ1361250

Authors: Lev D. Beklemishev 

Publication date: 12 March 1998

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

Full work available at URL: https://doi.org/10.1016/s0168-0072(96)00045-0

Recommendations

• Provably recursive functions of reflection
• scientific article; zbMATH DE number 1088194
• Parameter free induction and provably total computable functions
• Computer Science Logic

zbMATH Keywords

reflection principleinduction rulesnested applicationsprovably recursive function

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• On the scheme of induction for bounded arithmetic formulas
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• Fragments of arithmetic
• Title not available (Why is that?)
• On n-quantifier induction
• Induction rules, reflection principles, and provably recursive functions
• Herbrand analyses
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rekursionszahlen und die Grzegorczyk-Hierarchie
• The optimality of induction as an axiomatization of arithmetic
• Hierarchies of Primitive Recursive Functions
• Reflection Principles in Fragments of Peano Arithmetic
• Title not available (Why is that?)

Cited In (34)

• Local induction and provably total computable functions
• Semi-honest subrecursive degrees and the collection rule in arithmetic
• Functions provably total in $I^{-}Σ_{n}$
• Induction rules, reflection principles, and provably recursive functions
• Arithmetical interpretations and Kripke frames of predicate modal logic of provability
• AXIOMATIZATION OF PROVABLE n-PROVABILITY
• Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA
• Proof theoretic analysis by iterated reflection
• Title not available (Why is that?)
• Elementary descent recursion and proof theory
• MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE
• Computer Science Logic
• Fragments of Arithmetic and true sentences
• Interpretability in PRA
• Title not available (Why is that?)
• Provably recursive functions of reflection
• Hyperarithmetical worm battles
• A note on the \(\Pi_ 2^ 0\)-induction rule
• PREDICATIVITY THROUGH TRANSFINITE REFLECTION
• Provability algebras and proof-theoretic ordinals. I
• On nested simple recursion
• On the induction schema for decidable predicates
• Unprovability results for clause set cycles
• The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\)
• On axiom schemes for \(T\)-provably \(\Delta_1\) formulas
• Title not available (Why is that?)
• Parameter free induction and provably total computable functions
• Local induction and provably total computable functions: a case study
• A note on fragments of uniform reflection in second order arithmetic
• Induction rules in bounded arithmetic
• Some results on cut-elimination, provable well-orderings, induction and reflection
• Honest elementary degrees and degrees of relative provability without the cupping property
• AN INCOMPLETENESS THEOREM VIA ORDINAL ANALYSIS
• ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS

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)