Review: S. C. Kleene, Ernest Nagel, Patrick Suppes, Alfred Tarski, Turing-Machine Computable Functionals of Finite Types I; S. C. Kleene, Turing-Machine Computable Functionals of Finite Types II [Book Review]

Journal of Symbolic Logic 35 (4):588-589 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

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: S. C. Kleene, Countable Functionals; S. C. Kleene, Recursive Functionals of Higher Finite Types. [REVIEW]Donald L. Kreider - 1962 - Journal of Symbolic Logic 27 (3):359-360.
Unimonotone functions of finite types (recursive functionals and quantifiers of finite types revisited IV).S. C. Kleene - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 42--119.
Review: S. C. Kleene, Recursive Functionals and Quantifiers of Finite Types I. [REVIEW]A. Nerode - 1962 - Journal of Symbolic Logic 27 (1):82-83.
Review: S. C. Kleene, Recursive Functionals and Quantifiers of Finite Types II. [REVIEW]Thomas J. Grilliot - 1971 - Journal of Symbolic Logic 36 (1):146-146.
Review: S. C. Kleene, Lambda-Definable Functionals of Finite Types. [REVIEW]J. Barkley Rosser - 1964 - Journal of Symbolic Logic 29 (2):104-105.
A Turing Machine for Exponential Function.P. M. F. Lemos - manuscript
Is there a nonrecursive decidable equational theory?Benjamin Wells - 2002 - Minds and Machines 12 (2):301-324.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
The hereditary partial effective functionals and recursion theory in higher types.G. Longo & E. Moggi - 1984 - Journal of Symbolic Logic 49 (4):1319-1332.
Review: S. C. Kleene, A Note on Computable Functionals. [REVIEW]G. Kreisel - 1959 - Journal of Symbolic Logic 24 (1):51-52.
Turing L -machines and recursive computability for L -maps.Giangiacomo Gerla - 1989 - Studia Logica 48 (2):179 - 192.

Analytics

Added to PP
2013-11-22

Downloads
18 (#811,325)

6 months
3 (#992,474)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references