Induction rules, reflection principles, and provably recursive functions
- 23 May 1997
- journal article
- Published by Elsevier BV in Annals of Pure and Applied Logic
- Vol. 85 (3), 193-242
- https://doi.org/10.1016/s0168-0072(96)00045-0
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Induction rules, reflection principles, and provably recursive functionsAnnals of Pure and Applied Logic, 1997
- Herbrand analysesArchive for Mathematical Logic, 1991
- On the scheme of induction for bounded arithmetic formulasAnnals of Pure and Applied Logic, 1987
- Reflection Principles in Fragments of Peano ArithmeticMathematical Logic Quarterly, 1987
- Fragments of arithmeticAnnals of Pure and Applied Logic, 1985
- The optimality of induction as an axiomatization of arithmeticThe Journal of Symbolic Logic, 1983
- On n-quantifier inductionThe Journal of Symbolic Logic, 1972
- Rekursionszahlen und die Grzegorczyk-HierarchieArchive for Mathematical Logic, 1969
- Reflection Principles and their Use for Establishing the Complexity of Axiomatic SystemsMathematical Logic Quarterly, 1968
- Hierarchies of Primitive Recursive FunctionsMathematical Logic Quarterly, 1968