Yates [1970], who obtained a low minimal degree as a corollary to his con

In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press. pp. 81 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

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.
Jump Operator and Yates Degrees.Guohua Wu - 2006 - Journal of Symbolic Logic 71 (1):252 - 264.
Array nonrecursiveness and relative recursive enumerability.Mingzhong Cai - 2012 - Journal of Symbolic Logic 77 (1):21-32.
Minimal Complements for Degrees below 0ยด.Andrew Lewis - 2004 - Journal of Symbolic Logic 69 (4):937 - 966.
Prime models of computably enumerable degree.Rachel Epstein - 2008 - Journal of Symbolic Logic 73 (4):1373-1388.
Strong Minimal Covers for Recursively Enumerable Degrees.S. Barry Cooper - 1996 - Mathematical Logic Quarterly 42 (1):191-196.
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.
A minimal pair joining to a plus cupping Turing degree.Dengfeng Li & Angsheng Li - 2003 - Mathematical Logic Quarterly 49 (6):553-566.
Bounding minimal degrees by computably enumerable degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
Combinatorics on ideals and forcing with trees.Marcia J. Groszek - 1987 - Journal of Symbolic Logic 52 (3):582-593.
Grigorieff Forcing on Uncountable Cardinals Does Not Add a Generic of Minimal Degree.Brooke M. Andersen & Marcia J. Groszek - 2009 - Notre Dame Journal of Formal Logic 50 (2):195-200.
A Minimal Degree Which Collapses $omega_1$.Tim Carlson, Kenneth Kunen & Arnold W. Miller - 1984 - Journal of Symbolic Logic 49 (1):298-300.
Minimal groups in separably closed fields.E. Bouscaren & F. Delon - 2002 - Journal of Symbolic Logic 67 (1):239-259.

Analytics

Added to PP
2014-01-26

Downloads
4 (#1,619,724)

6 months
2 (#1,186,462)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references