A Dichotomy of the Recursively Enumerable Sets

Mathematical Logic Quarterly 14 (21-24):339-356 (1968)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,173

External links

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

Through your library

Analytics

Added to PP
2013-11-24

Downloads
48 (#457,243)

6 months
15 (#204,260)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Minimal pairs and high recursively enumerable degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
Minimal degrees and the jump operator.S. B. Cooper - 1973 - Journal of Symbolic Logic 38 (2):249-271.
Computational complexity, speedable and levelable sets.Robert I. Soare - 1977 - Journal of Symbolic Logic 42 (4):545-563.
Degrees of classes of RE sets.J. R. Shoenfield - 1976 - Journal of Symbolic Logic 41 (3):695-696.

View all 9 citations / Add more citations

References found in this work

Introduction to metamathematics.Stephen Cole Kleene - 1952 - Groningen: P. Noordhoff N.V..
Simplicity of recursively enumerable sets.Robert W. Robinson - 1967 - Journal of Symbolic Logic 32 (2):162-172.
Recursion, metarecursion, and inclusion.James C. Owings - 1967 - Journal of Symbolic Logic 32 (2):173-179.
A theorem on hyperhypersimple sets.Donald A. Martin - 1963 - Journal of Symbolic Logic 28 (4):273-278.
A theorem on maximal sets.Joseph S. Ullian - 1961 - Notre Dame Journal of Formal Logic 2 (4):222-223.

Add more references