Kleene's recursion theorem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Kleene's recursion theorem" in English language version.

refsWebsite

Global rank English rank

10worldcat.org

5^th place

4archive.org

6^th place

3doi.org

2^nd place

2semanticscholar.org

11^th place

8^th place

1thatmarcusfamily.org

low place

1jstor.org

26^th place

20^th place

1books.google.com

3^rd place

1sciencedirect.com

149^th place

178^th place

1handle.net

102^nd place

76^th place

archive.org (Global: 6^th place; English: 6^th place)

Kleene 1952. Kleene, Stephen C. (1952). Introduction to Metamathematics. Bibliotheca Mathematica. North-Holland Publishing. ISBN 9780720421033. OCLC 459805591. Retrieved 6 May 2020. {{cite book}}: ISBN / Date incompatibility (help)
Rogers 1967. Rogers, Hartley (1967). Theory of recursive functions and effective computability. Cambridge, Massachusetts: MIT Press. ISBN 9780262680523. OCLC 933975989. Retrieved 6 May 2020.
Rogers 1967, §11.2. Rogers, Hartley (1967). Theory of recursive functions and effective computability. Cambridge, Massachusetts: MIT Press. ISBN 9780262680523. OCLC 933975989. Retrieved 6 May 2020.
Kleene 1952, pp. 352–3. Kleene, Stephen C. (1952). Introduction to Metamathematics. Bibliotheca Mathematica. North-Holland Publishing. ISBN 9780720421033. OCLC 459805591. Retrieved 6 May 2020. {{cite book}}: ISBN / Date incompatibility (help)

books.google.com (Global: 3^rd place; English: 3^rd place)

Cutland, Nigel J. (1980). Computability: An Introduction to Recursive Function Theory. Cambridge University Press. p. 204. doi:10.1017/cbo9781139171496. ISBN 9781139935609. OCLC 488175597. Retrieved 6 May 2020.

doi.org (Global: 2^nd place; English: 2^nd place)

Kleene, Stephen C. (1938). "On notation for ordinal numbers" (PDF). Journal of Symbolic Logic. 3 (4): 150–155. doi:10.2307/2267778. ISSN 0022-4812. JSTOR 2267778. S2CID 34314018. Retrieved 6 May 2020.
Cutland, Nigel J. (1980). Computability: An Introduction to Recursive Function Theory. Cambridge University Press. p. 204. doi:10.1017/cbo9781139171496. ISBN 9781139935609. OCLC 488175597. Retrieved 6 May 2020.
Barendregt, Henk; Terwijn, Sebastiaan A. (2019). "Fixed point theorems for precomplete numberings". Annals of Pure and Applied Logic. 170 (10): 1151–1161. doi:10.1016/j.apal.2019.04.013. hdl:2066/205967. ISSN 0168-0072. S2CID 52289429. Retrieved 6 May 2020. p. 1151.

handle.net (Global: 102^nd place; English: 76^th place)

hdl.handle.net

Barendregt, Henk; Terwijn, Sebastiaan A. (2019). "Fixed point theorems for precomplete numberings". Annals of Pure and Applied Logic. 170 (10): 1151–1161. doi:10.1016/j.apal.2019.04.013. hdl:2066/205967. ISSN 0168-0072. S2CID 52289429. Retrieved 6 May 2020. p. 1151.

jstor.org (Global: 26^th place; English: 20^th place)

Kleene, Stephen C. (1938). "On notation for ordinal numbers" (PDF). Journal of Symbolic Logic. 3 (4): 150–155. doi:10.2307/2267778. ISSN 0022-4812. JSTOR 2267778. S2CID 34314018. Retrieved 6 May 2020.

sciencedirect.com (Global: 149^th place; English: 178^th place)

Barendregt, Henk; Terwijn, Sebastiaan A. (2019). "Fixed point theorems for precomplete numberings". Annals of Pure and Applied Logic. 170 (10): 1151–1161. doi:10.1016/j.apal.2019.04.013. hdl:2066/205967. ISSN 0168-0072. S2CID 52289429. Retrieved 6 May 2020. p. 1151.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Kleene, Stephen C. (1938). "On notation for ordinal numbers" (PDF). Journal of Symbolic Logic. 3 (4): 150–155. doi:10.2307/2267778. ISSN 0022-4812. JSTOR 2267778. S2CID 34314018. Retrieved 6 May 2020.
Barendregt, Henk; Terwijn, Sebastiaan A. (2019). "Fixed point theorems for precomplete numberings". Annals of Pure and Applied Logic. 170 (10): 1151–1161. doi:10.1016/j.apal.2019.04.013. hdl:2066/205967. ISSN 0168-0072. S2CID 52289429. Retrieved 6 May 2020. p. 1151.

thatmarcusfamily.org (Global: low place; English: low place)

Kleene, Stephen C. (1938). "On notation for ordinal numbers" (PDF). Journal of Symbolic Logic. 3 (4): 150–155. doi:10.2307/2267778. ISSN 0022-4812. JSTOR 2267778. S2CID 34314018. Retrieved 6 May 2020.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Kleene, Stephen C. (1938). "On notation for ordinal numbers" (PDF). Journal of Symbolic Logic. 3 (4): 150–155. doi:10.2307/2267778. ISSN 0022-4812. JSTOR 2267778. S2CID 34314018. Retrieved 6 May 2020.
Kleene 1952. Kleene, Stephen C. (1952). Introduction to Metamathematics. Bibliotheca Mathematica. North-Holland Publishing. ISBN 9780720421033. OCLC 459805591. Retrieved 6 May 2020. {{cite book}}: ISBN / Date incompatibility (help)
Rogers 1967. Rogers, Hartley (1967). Theory of recursive functions and effective computability. Cambridge, Massachusetts: MIT Press. ISBN 9780262680523. OCLC 933975989. Retrieved 6 May 2020.
Rogers 1967, §11.2. Rogers, Hartley (1967). Theory of recursive functions and effective computability. Cambridge, Massachusetts: MIT Press. ISBN 9780262680523. OCLC 933975989. Retrieved 6 May 2020.
Soare, R.I. (1987). Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets. Perspectives in Mathematical Logic. Berlin and New York City: Springer-Verlag. p. 88. ISBN 9780387152998. OCLC 318368332.
Jones 1997, pp. 229–30. Jones, Neil D. (1997). Computability and complexity: From a Programming Perspective. Cambridge, Massachusetts: MIT Press. ISBN 9780262100649. OCLC 981293265.
Kleene 1952, pp. 352–3. Kleene, Stephen C. (1952). Introduction to Metamathematics. Bibliotheca Mathematica. North-Holland Publishing. ISBN 9780720421033. OCLC 459805591. Retrieved 6 May 2020. {{cite book}}: ISBN / Date incompatibility (help)
Cutland, Nigel J. (1980). Computability: An Introduction to Recursive Function Theory. Cambridge University Press. p. 204. doi:10.1017/cbo9781139171496. ISBN 9781139935609. OCLC 488175597. Retrieved 6 May 2020.
Jones 1997. Jones, Neil D. (1997). Computability and complexity: From a Programming Perspective. Cambridge, Massachusetts: MIT Press. ISBN 9780262100649. OCLC 981293265.
Barendregt, Henk; Terwijn, Sebastiaan A. (2019). "Fixed point theorems for precomplete numberings". Annals of Pure and Applied Logic. 170 (10): 1151–1161. doi:10.1016/j.apal.2019.04.013. hdl:2066/205967. ISSN 0168-0072. S2CID 52289429. Retrieved 6 May 2020. p. 1151.

Kleene's recursion theorem (English Wikipedia)

archive.org (Global: 6th place; English: 6th place)

books.google.com (Global: 3rd place; English: 3rd place)

doi.org (Global: 2nd place; English: 2nd place)

handle.net (Global: 102nd place; English: 76th place)