Recursive Functionals and Quantifiers of Finite Types I

Journal of Symbolic Logic 27 (1):82-83 (1962)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2963692

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

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, Recursive Functionals and Quantifiers of Finite Types I. [REVIEW]A. Nerode - 1962 - Journal of Symbolic Logic 27 (1):82-83.
Kleene S. C.. Recursive functionals and quantifiers of finite types I. Transactions of the American Mathematical Society, vol. 91 , pp. 1–52. [REVIEW]A. Nerode - 1962 - Journal of Symbolic Logic 27 (1):82-83.
Recursive Functionals and Quantifiers of Finite Types II.S. C. Kleene - 1971 - Journal of Symbolic Logic 36 (1):146-146.
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.
Kleene S. C.. Recursive functionals and quantifiers of finite types II. Transactions of the American Mathematical Society, vol. 108 , pp. 106–142. [REVIEW]Thomas J. Grilliot - 1971 - Journal of Symbolic Logic 36 (1):146-146.
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. Providence, R.I.: American Mathematical Society. pp. 42--119.
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.
Turing-Machine Computable Functionals of Finite Types I.S. C. Kleene, Ernest Nagel, Patrick Suppes & Alfred Tarski - 1970 - Journal of Symbolic Logic 35 (4):588-589.
Review: A. Nerode, Additive Relations Among Recursive Equivalence Types. [REVIEW]Matthew J. Hassett - 1970 - Journal of Symbolic Logic 35 (4):589-590.
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. [REVIEW]D. A. Clarke - 1970 - Journal of Symbolic Logic 35 (4):588-589.

Analytics

Added to PP
2015-02-05

Downloads
5 (#1,562,727)

6 months
1 (#1,723,047)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Bounded functional interpretation.Fernando Ferreira & Paulo Oliva - 2005 - Annals of Pure and Applied Logic 135 (1):73-112.
Filter spaces and continuous functionals.J. M. E. Hyland - 1979 - Annals of Mathematical Logic 16 (2):101-143.
Godel's unpublished papers on foundations of mathematics.W. W. Tatt - 2001 - Philosophia Mathematica 9 (1):87-126.
Set recursion and Πhalf-logic.Jean-Yves Girard & Dag Normann - 1985 - Annals of Pure and Applied Logic 28 (3):255-286.

View all 15 citations / Add more citations

References found in this work

No references found.

Add more references