Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/on-nested-simple-recursion-ISth7axr0f
References (10)
-
Ján Komara, Paul Voda (1998)
Theorems af Péter and Parsons in Computer Programming -
S.R. Buss (1994)
Logic, Methodology and Philosophy of Science IX, 1991 -
L. Beklemishev (1995)
Induction Rules, Reflection Principles, and Provably Recursive FunctionsAnn. Pure Appl. Log., 85
-
C. Parsons (1970)
On a Number Theoretic Choice Schema and its Relation to InductionStudies in logic and the foundations of mathematics, 60
-
H.E. Rose (1982)
Subrecursion: Functions and Hierarchies Number 9 in Oxford Logic Guides -
R. Péter (1967)
Recursive Functions -
S. Buss (1995)
The witness function method and provably recursive functions of peano arithmeticStudies in logic and the foundations of mathematics, 134
-
W. Sieg (1991)
Herbrand analysesArch. Math. Log., 30
-
R. Peter (1935)
Über den Zusammenhang der verschiedenen Begriffe der rekursiven FunktionMathematische Annalen, 110
-
J. Komara, P.J. Voda (1999)
Proceedings of CSL’98, number 1584 in LNCS
- Publisher
- Springer Journals
- Copyright
- Copyright © 2011 by Springer-Verlag
- Subject
- Mathematics; Mathematics, general; Algebra; Mathematical Logic and Foundations
- ISSN
- 0933-5846
- eISSN
- 1432-0665
- DOI
- 10.1007/s00153-011-0236-9
- Publisher site
- See Article on Publisher Site
Abstract
We give a novel proof that primitive recursive functions are closed under nested simple recursion. This new presentation is supplied with a detailed proof which can be easily formalized in small fragments of Peano Arithmetic.
Journal
Archive for Mathematical Logic – Springer Journals
Published: Apr 30, 2011