On nested simple recursion

Archive for Mathematical Logic 50 (5-6):617-624 (2011)
  Copy   BIBTEX

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.

Categories

Keywords

Reprint years

DOI

10.1007/s00153-011-0236-9

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Mind as a nested operational architectonics of the brain.Andrew A. Fingelkurts & Alexander A. Fingelkurts - 2012 - Physics of Life Reviews 9 (1):49-50.
Nested Named Entity Recognition.Christopher D. Manning - unknown
Some new double induction and superinduction principles.Raymond M. Smullyan - 1990 - Studia Logica 49 (1):23 - 30.
Ordinal analysis of simple cases of bar recursion.W. A. Howard - 1981 - Journal of Symbolic Logic 46 (1):17-30.
Monotone majorizable functionals.Helmut Schwichtenberg - 1999 - Studia Logica 62 (2):283-289.
What is Radical Recursion?Steven M. Rosen - 2004 - SEED Journal 4 (1):38-57.
Two-dimensional semantics and the nesting problem.David J. Chalmers & Brian Rabern - 2014 - Analysis 74 (2):210-224.
Recursion theory for metamathematics.Raymond Merrill Smullyan - 1993 - New York: Oxford University Press.
Fictions within fictions.Reina Hayaki - 2008 - Philosophical Studies 146 (3):379 - 398.
Recursion theory.Anil Nerode & Richard A. Shore (eds.) - 1985 - Providence, R.I.: American Mathematical Society.
Generalized recursion theory.Jens Erik Fenstad & Peter G. Hinman (eds.) - 1974 - New York,: American Elsevier Pub. Co..
General recursion theory: an axiomatic approach.Jens Erik Fenstad - 1980 - New York: Springer Verlag.
Fractal Analysis Illuminates the Form of Connectionist Structural Gradualness.Whitney Tabor, Pyeong Whan Cho & Emily Szkudlarek - 2013 - Topics in Cognitive Science 5 (3):634-667.
Recursion on the countable functionals.Dag Normann - 1980 - New York: Springer Verlag.
Contributions to [alpha]- and [beta]-recursion theory.Wolfgang Maass - 1978 - München: Minerva-Publikation.

Analytics

Added to PP
2013-10-27

Downloads
34 (#459,882)

6 months
10 (#255,509)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Herbrand analyses.Wilfried Sieg - 1991 - Archive for Mathematical Logic 30 (5-6):409-441.

Add more references