A recursively enumerable degree which will not split over all lesser ones

Annals of Mathematical Logic 9 (4):307 (1976)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0003-4843(76)90016-4

Links

PhilArchive



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

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

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.
Lachlan A. H.. On some games which are relevant to the theory of recursively enumerable sets. Annals of mathematics, ser. 2 vol. 91 , pp. 291–310. [REVIEW]Gregory W. Jones - 1974 - Journal of Symbolic Logic 39 (2):345-345.
Review: A. H. Lachlan, On Some Games which are Relevant to the Theory of Recursively Enumerable Sets. [REVIEW]Gregory W. Jones - 1974 - Journal of Symbolic Logic 39 (2):345-345.
Review: A. H. Lachlan, Lower Bounds for Pairs of Recursively Enumerable Degrees. [REVIEW]Carl G. Jockusch - 1972 - Journal of Symbolic Logic 37 (3):611-611.
Review: A. H. Lachlan, The Impossibility of Finding Relative Complements for Recursively Enumerable Degrees. [REVIEW]Gerald E. Sacks - 1971 - Journal of Symbolic Logic 36 (3):539-540.
Lachlan A. H.. Lower bounds for pairs of recursively enumerable degrees. Proceedings of the London Mathematical Society, set. 3 vol. 16 part 3 , pp. 537–569. [REVIEW]Carl G. Jockosch - 1972 - Journal of Symbolic Logic 37 (3):611-611.
A Splitting with Infimum in the d-c. e. Degrees.Q. Lei, L. Hong & D. Decheng - 2000 - Mathematical Logic Quarterly 46 (1):53-76.
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.
Strong Minimal Covers for Recursively Enumerable Degrees.S. Barry Cooper - 1996 - Mathematical Logic Quarterly 42 (1):191-196.
Recursively enumerable vector spaces.G. Metakides - 1977 - Annals of Mathematical Logic 11 (2):147.

Analytics

Added to PP
2014-01-17

Downloads
11 (#1,166,121)

6 months
2 (#1,259,919)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The d.r.e. degrees are not dense.S. Cooper, Leo Harrington, Alistair Lachlan, Steffen Lempp & Robert Soare - 1991 - Annals of Pure and Applied Logic 55 (2):125-151.
A splitting theorem for the Medvedev and Muchnik lattices.Stephen Binns - 2003 - Mathematical Logic Quarterly 49 (4):327.
Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
The density of the nonbranching degrees.Peter A. Fejer - 1983 - Annals of Pure and Applied Logic 24 (2):113-130.

View all 36 citations / Add more citations

References found in this work

Degrees of Unsolvability.Gerald E. Sacks - 1966 - Princeton University Press.

Add more references