Publisher： Cambridge University Press
E-ISSN： 1943-5886|39|4|655-660
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.39, Iss.4, 1974-12, pp. : 655-660
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
A. H. Lachlan [2] and C. E. M. Yates [4] independently showed that minimal pairs of recursively enumerable (r.e.) degrees exist. Lachlan and Richard Ladner have shown (unpublished) that there is no uniform method for producing a minimal pair of r.e. degrees below a given nonzero r.e. degree. It is not known whether every nonzero r.e. degree bounds a r.e. minimal pair, but in the present paper it is shown (uniformly) that every
Related content
A minimal pair of recursively enumerable degrees
The Journal of Symbolic Logic, Vol. 31, Iss. 2, 1966-06 ,pp. :
Access to resources
Recommend
Definability in the Recursively Enumerable Degrees
Bulletin of Symbolic Logic, Vol. 2, Iss. 4, 1996-12 ,pp. :
Lattice embeddings into the recursively enumerable degrees
The Journal of Symbolic Logic, Vol. 51, Iss. 2, 1986-06 ,pp. :