Classes of Recursively Enumerable Sets and Degrees of Unsolvability

Mathematical Logic Quarterly 12 (1):295-310 (1966)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,867

External links

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

Through your library

Similar books and articles

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.
Standard Classes of Recursively Enumerable Sets.A. H. Lachlan - 1964 - Mathematical Logic Quarterly 10 (2-3):23-42.

Analytics

Added to PP
2014-01-16

Downloads
28 (#556,414)

6 months
11 (#340,569)

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.
Recursive isomorphism types of recursive Boolean algebras.J. B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):572-594.
Double Jumps of Minimal Degrees.Carl G. Jockusch & David B. Posner - 1978 - Journal of Symbolic Logic 43 (4):715 - 724.
Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.

View all 84 citations / Add more citations

References found in this work

Introduction to metamathematics.Stephen Cole Kleene - 1952 - Groningen: P. Noordhoff N.V..
Introduction to Metamathematics.H. Rasiowa - 1954 - Journal of Symbolic Logic 19 (3):215-216.
Degrees of Unsolvability.Gerald E. Sacks - 1966 - Princeton University Press.

Add more references