C. E. M. Yates. A minimal pair of recursively enumerable degrees. The journal of symbolic logic, vol. 31 , pp. 159–168

Journal of Symbolic Logic 37 (3):611 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272772

Links

PhilArchive



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

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

Review: C. E. M. Yates, A Minimal Pair of Recursively Enumerable Degrees. [REVIEW]Robert W. Robinson - 1972 - Journal of Symbolic Logic 37 (3):611-611.
C. E. M. Yates. Three theorems on the degrees of recursively enumerable sets. Duke mathematical journal, vol. 32 , pp. 461–468. [REVIEW]Hartley Rogers - 1967 - Journal of Symbolic Logic 32 (3):394-395.
Review: C. E. M. Yates, Three Theorems on the Degrees of Recursively Enumerable Sets. [REVIEW]Hartley Rogers - 1967 - Journal of Symbolic Logic 32 (3):394-395.
Review: C. E. M. Yates, John N. Crossley, Recursively Enumerable Degrees and the Degrees Less Than $0^{(1)}$. [REVIEW]S. K. Thomason - 1970 - Journal of Symbolic Logic 35 (4):589-589.
Robert W. Robinson. Simplicity of recursively enumerable sets.The journal of symbolic logic, vol. 32 , pp. 162–172. - Robert W. Robinson. Two theorems on hyperhypersimple sets. Transactions of the American Mathematical Society, vol. 128 , pp. 531–538. - A. H. Lachlan. On the lattice of recursively enumerable sets.Transactions of the American Mathematical Society, vol. 130 , pp. 1–37. - A. H. Lachlan. The elementary theory of recursively enumerable sets. Duke mathematical journal, vol. 35 , pp. 123–146. [REVIEW]James C. Owings - 1970 - Journal of Symbolic Logic 35 (1):153-155.
A minimal pair of recursively enumerable degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
Review: C. E. M. Yates, Recursively Enumerable Sets and Retracting Functions. [REVIEW]Hartley Rogers - 1967 - Journal of Symbolic Logic 32 (3):394-394.
A. H. Lachlan. The impossibility of finding relative complements for recursively enumerable degrees. The journal of symbolic logic, vol. 31 , pp. 434–454. [REVIEW]Gerald E. Sacks - 1971 - Journal of Symbolic Logic 36 (3):539-540.
Robinson Robert W.. Simplicity of recursively enumerable sets.James C. Owings - 1970 - Journal of Symbolic Logic 35 (1):153-155.
Cooper S. B.. Degrees of unsolvability complementary between recursively enumerable degrees, Part I. Annals of mathematical logic, vol. 4 no. 1 , pp. 31–73. [REVIEW]Dick Epstein - 1975 - Journal of Symbolic Logic 40 (1):86-86.

Analytics

Added to PP
2016-06-30

Downloads
29 (#135,560)

6 months
3 (#1,723,834)

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