Recursively Enumerable Sets of Positive Integers and Their Decision Problems

Journal of Symbolic Logic 10 (1):18-19 (1945)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2267203

Links

PhilArchive



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

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: Emil L. Post, Recursively Enumerable Sets of Positive Integers and Their Decision Problems. [REVIEW]J. C. C. McKinsey - 1945 - Journal of Symbolic Logic 10 (1):18-19.
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.
Index sets in the arithmetical Hierarchy.Ulrike Brandt - 1988 - Annals of Pure and Applied Logic 37 (2):101-110.
On a Class of Recursively Enumerable Sets.Farzad Didehvar - 1999 - Mathematical Logic Quarterly 45 (4):467-470.
A non-splitting theorem for d.r.e. sets.Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (1):17-96.
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.
Classes of Recursively Enumerable Sets and their Decision Problems.H. G. Rice - 1954 - Journal of Symbolic Logic 19 (2):121-122.
Effective Nonrecursiveness.Takeshi Yamaguchi - 1997 - Mathematical Logic Quarterly 43 (1):45-48.
Definable structures in the lattice of recursively enumerable sets.E. Herrmann - 1984 - Journal of Symbolic Logic 49 (4):1190-1197.
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.
Randomness and Recursive Enumerability.Siam J. Comput - unknown
The role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.

Analytics

Added to PP
2015-02-05

Downloads
13 (#978,482)

6 months
4 (#698,851)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Alan Turing and the mathematical objection.Gualtiero Piccinini - 2003 - Minds and Machines 13 (1):23-48.
Degree structures of conjunctive reducibility.Irakli Chitaia & Roland Omanadze - 2021 - Archive for Mathematical Logic 61 (1):19-31.
Thinking may be more than computing.Peter Kugel - 1986 - Cognition 22 (2):137-198.

View all 41 citations / Add more citations

References found in this work

No references found.

Add more references