Editing Primitive recursive function (section)

== References ==
* {{citation|last1=Brainerd |first1=W.S. |last2=Landweber |first2=L.H. |year=1974 |title=Theory of Computation |publisher=Wiley |isbn=0471095850}} 
* {{citation|last=Hartmanis |first=Juris |author-link=Juris Hartmanis |year=1989|chapter=Overview of Computational Complexity Theory |title=Computational Complexity Theory |publisher=American Mathematical Society|pages=1–17 |isbn=978-0-8218-0131-4 |series=Proceedings of Symposia in Applied Mathematics |volume=38 |mr=1020807}}
* [[Robert I. Soare]], ''Recursively Enumerable Sets and Degrees'', Springer-Verlag, 1987.  {{isbn|0-387-15299-7}}
* {{citation |last=Kleene |first=Stephen Cole |author-link=Stephen Cole Kleene |year=1952|title=Introduction to Metamathematics |edition=7th [1974] reprint; 2nd |publisher=[[North-Holland Publishing Company]] |oclc=3757798 |isbn=0444100881}} Chapter XI. General Recursive Functions §57
*{{citation |author-link=George Boolos |first1=George |last1=Boolos |author2-link=John P. Burgess |first2=John |last2=Burgess |author3-link=Richard Jeffrey |first3=Richard |last3=Jeffrey |title=Computability and Logic |publisher=Cambridge University Press |edition=4th |date=2002 |isbn=9780521007580 |pages=70–71}}
*{{citation
 | last = Soare | first = Robert I.
 | doi = 10.2307/420992
 | issue = 3
 | journal = The Bulletin of Symbolic Logic
 | mr = 1416870
 | pages = 284–321
 | title = Computability and recursion
 | url = https://scholar.archive.org/work/ruvjr6nkyre4nfxjdme2refpwe
 | volume = 2
 | year = 1996| jstor = 420992
 }}
*{{citation
 | last = Severin | first = Daniel E.
 | arxiv = cs/0603063
 | doi = 10.2178/jsl/1230396909
 | issue = 4
 | journal = The Journal of Symbolic Logic
 | jstor = 275903221
 | mr = 2467207
 | pages = 1122–1138
 | title = Unary primitive recursive functions
 | volume = 73
 | year = 2008}}
*{{citation
 | last = Robinson | first = Raphael M.
 | doi = 10.1090/S0002-9904-1947-08911-4
 | journal = Bulletin of the American Mathematical Society
 | mr = 22536
 | pages = 925–942
 | title = Primitive recursive functions
 | volume = 53
 | year = 1947| issue = 10
 | doi-access = free
 }}
*{{citation
 | last = Gladstone | first = M. D.
 | doi = 10.2307/2270177
 | journal = The Journal of Symbolic Logic
 | mr = 224460
 | pages = 505–508
 | title = A reduction of the recursion scheme
 | volume = 32
 | year = 1967| issue = 4
 | jstor = 2270177
 }}
*{{citation
 | last = Gladstone | first = M. D.
 | doi = 10.2307/2272468
 | journal = The Journal of Symbolic Logic
 | mr = 305993
 | pages = 653–665
 | title = Simplifications of the recursion scheme
 | volume = 36
 | year = 1971| issue = 4
 | jstor = 2272468
 }}

{{Mathematical logic}}

[[Category:Computability theory]]
[[Category:Theory of computation]]
[[Category:Functions and mappings]]
[[Category:Recursion]]