Kleene's recursion theorem: Difference between revisions

Content deleted Content added
References: Changing to {{ndash}} for pages reference
References: Adding JSTOR link to Jockusch 1989
Line 154:
* {{Cite journal|last=Kleene|first=S. C.|author-link=Stephen Cole Kleene|date=1938|title=On notation for ordinal numbers|url=http://www.thatmarcusfamily.org/philosophy/Course_Websites/Readings/Kleene%20-%20Ordinals.pdf|journal=[[Journal of Symbolic Logic]]|language=English|volume=3|issue=4|pages=150{{ndash}}155|doi=10.2307/2267778|jstor=2267778|issn=0022-4812|access-date=6 May 2020|url-status=live}}
* {{Cite book|last=Kleene|first=S. C.|author-link=Stephen Cole Kleene|date=1952|title=Introduction to Metamathematics|url=https://archive.org/details/BubliothecaMathematicaStephenColeKleeneIntroductionToMetamathematicsWoltersNoordhoffPublishing1971|publisher=[[North-Holland Publishing]]|language=English|series=Bibliotheca Mathematica|isbn=9780720421033|oclc=459805591|access-date=6 May 2020|url-status=live}}
* {{Cite journal|last=Jockusch|first=C. G.|author-link1=Carl Jockusch|last2=Lerman|first2=M.|last3=Soare|first3=R. I.|author-link3=Robert I. Soare|last4=Solovay|first4=R. M.|author-link4=Robert M. Solovay|date=1989|title=Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion|journal=[[The Journal of Symbolic Logic]]|language=English|volume=54|issue=4|pages=1288{{ndash}}1323|doi=10.1017/S0022481200041104|jstor=2274816|issn=0022-4812}}
* {{Cite book|last=Jones|first=Neil D.|date=1997|author-link=Neil D. Jones|title=Computability and complexity: From a Programming Perspective|publisher=[[MIT Press]]|isbn=9780262100649|___location=Cambridge, Massachusetts|language=English|oclc=981293265}}
* {{Cite book|last=Rogers|first=Hartley|author-link=Hartley Rogers Jr.|date=1967|title=Theory of recursive functions and effective computability|url=https://archive.org/details/theoryofrecursiv00roge|publisher=[[MIT Press]]|___location=Cambridge, Massachusetts|language=English|oclc=933975989|isbn=9780262680523|access-date=6 May 2020|url-status=live|url-access=registration}}