Review: H. G. Rice, On Completely Recursively Enumerable Classes and Their Key Arrays [Book Review]

Journal of Symbolic Logic 23 (1):48-48 (1958)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2964482

Links

PhilArchive



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

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

On completely recursively enumerable classes and their key arrays.H. G. Rice - 1956 - Journal of Symbolic Logic 21 (3):304-308.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Review: H. G. Rice, Classes of Recursively Enumerable Sets and their Decision Problems. [REVIEW]Rózsa Péter - 1954 - Journal of Symbolic Logic 19 (2):121-122.
On injective enumerability of recursively enumerable classes of cofinite sets.Stephan Wehner - 1995 - Archive for Mathematical Logic 34 (3):183-196.
Review: H. G. Rice, Recursive and Recursively Enumerable Orders. [REVIEW]Martin Davis - 1957 - Journal of Symbolic Logic 22 (4):375-375.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Review: J. C. E. Dekker, J. Myhill, Some Theorems on Classes of Recursively Enumerable Sets. [REVIEW]Martin Davis - 1962 - Journal of Symbolic Logic 27 (1):84-84.
Review: Donald A. Martin, Classes of Recursively Enumerable Sets and Degrees of Unsolvability. [REVIEW]K. Appel - 1967 - Journal of Symbolic Logic 32 (4):528-528.
Review: A. Mostowski, On a System of Axioms which has no Recursively Enumerable Arithmetic Model; A. Mostowski, A Formula with no Recursively Enumerable Model. [REVIEW]G. Hasenjaeger - 1958 - Journal of Symbolic Logic 23 (1):45-45.
The role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.
Randomness and Recursive Enumerability.Siam J. Comput - unknown
Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.
Complete, Recursively Enumerable Relations in Arithmetic.Giovanna D'Agostino & Mario Magnago - 1995 - Mathematical Logic Quarterly 41 (1):65-72.

Analytics

Added to PP
2013-11-22

Downloads
12 (#1,062,297)

6 months
9 (#295,075)

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