Kleene S. C.. Extension of an effectively generated class of functions by enumeration. Colloquium mathematicum, vol. 6 , pp. 68–78 [Book Review]

Journal of Symbolic Logic 25 (3):279-280 (1960)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,100

External links

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

Through your library

Similar books and articles

The jump operator on the ω-enumeration degrees.Hristo Ganchev & Ivan N. Soskov - 2009 - Annals of Pure and Applied Logic 160 (3):289-301.
Independence-friendly cylindric set algebras.Allen Mann - 2009 - Logic Journal of the IGPL 17 (6):719-754.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.
Relative lawlessness in intuitionistic analysis.Joan Rand Moschovakis - 1987 - Journal of Symbolic Logic 52 (1):68-88.
A jump inversion theorem for the enumeration jump.I. N. Soskov - 2000 - Archive for Mathematical Logic 39 (6):417-437.
Accessible recursive functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.

Analytics

Added to PP
2016-06-30

Downloads
16 (#908,545)

6 months
2 (#1,202,487)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

William W. Tait
University of Chicago

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references