Classes of Recursively Enumerable Sets and Degrees of Unsolvability

Journal of Symbolic Logic 32 (4):528-528 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270203

Links

PhilArchive



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

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

Classes of Recursively Enumerable Sets and Degrees of Unsolvability.Donald A. Martin - 1966 - Mathematical Logic Quarterly 12 (1):295-310.
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.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
On Recursive Enumerability with Finite Repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
omnibus Review. [REVIEW]Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
[Omnibus Review].Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability.R. M. Friedberg - 1958 - Journal of Symbolic Logic 23 (2):225-226.
The density of infima in the recursively enumerable degrees.Theodore A. Slaman - 1991 - Annals of Pure and Applied Logic 52 (1-2):155-179.
The Fine Structure of Degrees of Unsolvability of Recursively Enumerable Sets.R. M. Friedberg - 1963 - Journal of Symbolic Logic 28 (2):166-166.
Mass problems and almost everywhere domination.Stephen G. Simpson - 2007 - Mathematical Logic Quarterly 53 (4):483-492.
Review: R. M. Friedberg, The Fine Structure of Degrees of Unsolvability of Recursively Enumerable Sets. [REVIEW]Gerald E. Sacks - 1963 - Journal of Symbolic Logic 28 (2):166-166.
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.
On injective enumerability of recursively enumerable classes of cofinite sets.Stephan Wehner - 1995 - Archive for Mathematical Logic 34 (3):183-196.
Review: R. M. Friedberg, Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability (Solution of Post's Problem, 1944). [REVIEW]Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (2):225-226.

Analytics

Added to PP
2017-02-21

Downloads
10 (#1,123,760)

6 months
5 (#526,961)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Donald A. Martin
University of California, Los Angeles

Citations of this work

On the Strength of Ramsey's Theorem.David Seetapun & Theodore A. Slaman - 1995 - Notre Dame Journal of Formal Logic 36 (4):570-582.
Small Π01 Classes.Stephen Binns - 2006 - Archive for Mathematical Logic 45 (4):393-410.
Relativized Schnorr tests with universal behavior.Nicholas Rupprecht - 2010 - Archive for Mathematical Logic 49 (5):555-570.
Small Π0 1 Classes.Stephen Binns - 2005 - Archive for Mathematical Logic 45 (4):393-410.

View all 6 citations / Add more citations

References found in this work

No references found.

Add more references