Review: V. A. Uspenskij, Some Notes on Recursively Enumerable Sets [Book Review]

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

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2964486

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

Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
Splitting theorems for speed-up related to order of enumeration.A. M. Dawes - 1982 - Journal of Symbolic Logic 47 (1):1-7.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.
Definable structures in the lattice of recursively enumerable sets.E. Herrmann - 1984 - Journal of Symbolic Logic 49 (4):1190-1197.
Review: V. A. Uspenskij, Systems of Enumerable Sets and Their Enumerations. [REVIEW]Andrzej Ehrenfeucht - 1957 - Journal of Symbolic Logic 22 (2):220-220.
Review: J. C. E. Dekker, Two Notes on Recursively Enumerable Sets. [REVIEW]Martin Davis - 1955 - Journal of Symbolic Logic 20 (1):73-74.
Review: A. A. Mucnik, On Separability of Recursively Enumerable Sets. [REVIEW]Andrzej Mostowski - 1958 - Journal of Symbolic Logic 23 (2):224-225.
Review: U. T. Medvedev, On Non-Isomorphic Recursively Enumerable Sets. [REVIEW]Andrzej Mostowski - 1956 - Journal of Symbolic Logic 21 (1):101-102.
The role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.
Automorphisms of the lattice of recursively enumerable sets.Peter Cholak - 1995 - Providence, RI: American Mathematical Society.
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.
On a Class of Recursively Enumerable Sets.Farzad Didehvar - 1999 - Mathematical Logic Quarterly 45 (4):467-470.
Randomness and Recursive Enumerability.Siam J. Comput - unknown

Analytics

Added to PP
2013-11-22

Downloads
4 (#1,599,757)

6 months
1 (#1,516,429)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Degree spectra and immunity properties.Barbara F. Csima & Iskander S. Kalimullin - 2010 - Mathematical Logic Quarterly 56 (1):67-77.

Add more citations

References found in this work

No references found.

Add more references