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

Other Versions

original Martin, Donald A. (1966) "Classes of Recursively Enumerable Sets and Degrees of Unsolvability". Mathematical Logic Quarterly 12(1):295-310

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,885

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.
The Fine Structure of Degrees of Unsolvability of Recursively Enumerable Sets.R. M. Friedberg - 1963 - Journal of Symbolic Logic 28 (2):166-166.
Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability.R. M. Friedberg - 1958 - Journal of Symbolic Logic 23 (2):225-226.
Word Problems and Recursively Enumerable Degrees of Unsolvability. An Emendation.William W. Boone & Donald J. Collins - 1974 - Journal of Symbolic Logic 39 (1):184-185.
Partial Results Regarding Word Problems and Recursively Enumerable Degrees of Unsolvability.William W. Boone - 1963 - Journal of Symbolic Logic 28 (4):292-292.
Friedberg R. M.. Two recursively enumerable sets of incomparable degrees of unsolvability . Proceedings of the National Academy of Sciences of the United States of America, vol. 43 , pp. 236–238. [REVIEW]Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (2):225-226.
Minimal weak truth table degrees and computably enumerable Turing degrees.R. G. Downey - 2020 - Providence, RI: American Mathematical Society. Edited by Keng Meng Ng & Reed Solomon.

Analytics

Added to PP
2017-02-21

Downloads
18 (#1,192,597)

6 months
5 (#826,666)

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