Revision as of 17:41, 23 January 2021 edit Finnusertop (talk \| contribs) Autopatrolled, Extended confirmed users 90,338 edits →top: {{Format footnotes\|date=January 2021\|reason=Parenthetical referencing has been deprecated; convert to shortened footnotes.}} ← Previous edit		Revision as of 09:48, 8 February 2021 edit undo Citation bot (talk \| contribs) Bots 5,866,819 edits Alter: url. URLs might have been internationalized/anonymized. Add: s2cid, author pars. 1-1. Removed parameters. Some additions/deletions were actually parameter name changes. \| You can use this bot yourself. Report bugs here. \| Suggested by Abductive \| Category:Articles with Stanford Encyclopedia of Philosophy links‎ \| via #UCB_Category 20/43 Next edit →
Line 151: == References == * {{Cite journal\|last1=Barendregt\|first1=Henk\|author-link1=Henk Barendregt\|last2=Terwijn\|first2=Sebastiaan A.\|date=2019\|title=Fixed point theorems for precomplete numberings\|url=http://www.sciencedirect.com/science/article/pii/S016800721930048X\|journal=Annals of Pure and Applied Logic\|language=en\|volume=170\|issue=10\|pages=1151{{ndash}}1161\|doi=10.1016/j.apal.2019.04.013\|hdl=2066/205967\|s2cid=52289429\|issn=0168-0072\|access-date=6 May 2020\|url-access=subscription\|hdl-access=free}} * {{Cite book\|last=Cutland\|first=Nigel J.\|author-link=Nigel Cutland\|date=1980\|title=Computability: An Introduction to Recursive Function Theory\|url=https://books.google.com/books?id=wAstOUE36kcC~~&printsec=frontcover~~\|publisher=[[Cambridge University Press]]\|language=en\|doi=10.1017/cbo9781139171496\|isbn=9781139935609\|oclc=488175597\|access-date=6 May 2020}} * {{Cite book\|last=Ershov\|first=Yuri L\|author-link=Yury Yershov\|editor-last=Griffor\|editor-first=Edward R\|date=1999\|url=https://books.google.com/books?id=KqeXZ4pPd5QC~~&printsec=frontcover~~\|title=Handbook of Computability Theory\|chapter=Part 4: Mathematics and Computability Theory. 14. Theory of numbering\|series=Studies in logic and the foundations of mathemtics\|volume=140\|pages=473{{ndash}}503\|publisher=[[Elsevier]]\|___location=Amsterdam\|language=en\|oclc=162130533\|isbn=9780444898821\|access-date=6 May 2020}} * {{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=en\|volume=3\|issue=4\|pages=150{{ndash}}155\|doi=10.2307/2267778\|jstor=2267778\|issn=0022-4812\|access-date=6 May 2020}} * {{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=en\|series=Bibliotheca Mathematica\|isbn=9780720421033\|oclc=459805591\|access-date=6 May 2020}} * {{Cite journal\|~~last~~last1=Jockusch\|~~first~~first1=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=en\|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=en\|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=en\|oclc=933975989\|isbn=9780262680523\|access-date=6 May 2020\|url-access=registration}}

Kleene's recursion theorem: Difference between revisions