Review: Hartley Rogers, Theory of Recursive Functions and Effective Computability [Book Review]

Journal of Symbolic Logic 24 (1):70-70 (1959)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2964608

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,783

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: Hartley Rogers, Theory of Recursive Functions and Effective Computability. [REVIEW]C. E. M. Yates - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge, Mass.: MIT Press.
Review: Hartley Rogers, Recursive Functions over Well-Ordered Partial Orderings. [REVIEW]J. R. Shoenfield - 1962 - Journal of Symbolic Logic 27 (1):83-84.
Review: Hartley Rogers, Godel Numberings of Partial Recursive Functions. [REVIEW]Martin Davis - 1964 - Journal of Symbolic Logic 29 (3):146-146.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Gödel numberings of partial recursive functions.Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (3):331-341.
Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2010 - Academic Press.
Remarks on the development of computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.
Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 1980 - New York: Cambridge University Press. Edited by John P. Burgess & Richard C. Jeffrey.
Computability, an introduction to recursive function theory.Nigel Cutland - 1980 - New York: Cambridge University Press.
Uniformly reflexive structures: towards an abstract theory of computability.Eric Gerhardt Wagner - 1963 - [New York: [S.N.].
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Review: Daniel Lacombe, Sur le Semi-Reseau Constitue par les Degres d'Indecidabilite Recursive. [REVIEW]Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (2):226-226.

Analytics

Added to PP
2013-11-22

Downloads
4 (#1,621,857)

6 months
1 (#1,467,486)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references