Content deleted Content added
m Open access bot: hdl added to citation with #oabot. |
|||
Line 149:
== 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=English|volume=170|issue=10|pages=1151{{ndash}}1161|doi=10.1016/j.apal.2019.04.013|hdl=2066/205967|issn=0168-0072|access-date=6 May 2020|url-status=live|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=English|doi=10.1017/cbo9781139171496|isbn=9781139935609|oclc=488175597|access-date=6 May 2020|url-status=live}}
* {{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=English|oclc=162130533|isbn=9780444898821|access-date=6 May 2020|url-status=live}}
| |||