Minimal α-degrees

Annals of Mathematical Logic 4 (4):393-414 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0003-4843(72)90006-x

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

A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree.Mingzhong Cai - 2010 - Notre Dame Journal of Formal Logic 51 (4):443-455.
A high c.e. degree which is not the join of two minimal degrees.Matthew B. Giorgi - 2010 - Journal of Symbolic Logic 75 (4):1339-1358.
Bounding and Nonbounding Minimal Pairs in the Enumeration Degrees.S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang - 2005 - Journal of Symbolic Logic 70 (3):741 - 766.
Properly Σ2 minimal degrees and 0″ complementation.S. Barry Cooper, Andrew E. M. Lewis & Yue Yang - 2005 - Mathematical Logic Quarterly 51 (3):274-276.
Bounding minimal degrees by computably enumerable degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
On a problem of Cooper and Epstein.Shamil Ishmukhametov - 2003 - Journal of Symbolic Logic 68 (1):52-64.
Some More Minimal Pairs of α‐Recursively Enumerable Degrees.Richard A. Shore - 1978 - Mathematical Logic Quarterly 24 (25‐30):409-418.
Definability and initial segments of c-degrees.Robert S. Lubarsky - 1988 - Journal of Symbolic Logic 53 (4):1070-1081.
Degrees of Monotone Complexity.William C. Calhoun - 2006 - Journal of Symbolic Logic 71 (4):1327 - 1341.
Degrees which do not bound minimal degrees.Manuel Lerman - 1986 - Annals of Pure and Applied Logic 30 (3):249-276.
Initial segments of the degrees of unsolvability part II: Minimal degrees.C. E. M. Yates - 1970 - Journal of Symbolic Logic 35 (2):243-266.
Minimal degrees recursive in 1-generic degrees.C. T. Chong & R. G. Downey - 1990 - Annals of Pure and Applied Logic 48 (3):215-225.
1-Generic degrees and minimal degrees in higher recursion theory, II.C. T. Chong - 1986 - Annals of Pure and Applied Logic 31:165-175.
Wtt-degrees and t-degrees of R.e. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.
Yates [1970], who obtained a low minimal degree as a corollary to his con.of Minimal Degrees Below - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press. pp. 81.

Analytics

Added to PP
2014-01-17

Downloads
13 (#978,482)

6 months
4 (#698,851)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

One hundred and two problems in mathematical logic.Harvey Friedman - 1975 - Journal of Symbolic Logic 40 (2):113-129.
Perfect trees and elementary embeddings.Sy-David Friedman & Katherine Thompson - 2008 - Journal of Symbolic Logic 73 (3):906-918.
Inadmissibility, tame R.E. sets and the admissible collapse.Wolfgang Maass - 1978 - Annals of Mathematical Logic 13 (2):149-170.
Σn sets which are Δn-incomparable.Richard A. Shore - 1974 - Journal of Symbolic Logic 39 (2):295 - 304.
The recursively enumerable alpha-degrees are dense.Richard A. Shore - 1976 - Annals of Mathematical Logic 9 (1/2):123.

View all 8 citations / Add more citations

References found in this work

The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
Metarecursive sets.G. Kreisel & Gerald E. Sacks - 1965 - Journal of Symbolic Logic 30 (3):318-338.
Degrees of Unsolvability.Gerald E. Sacks - 1966 - Princeton University Press.
A theorem on minimal degrees.J. R. Shoenfield - 1966 - Journal of Symbolic Logic 31 (4):539-544.
The alpha-finite injury method.G. E. Sacks - 1972 - Annals of Mathematical Logic 4 (4):343.

View all 9 references / Add more references