Initial segments of the degrees of unsolvability Part II: minimal degrees

1 June 1970

journal article
Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic

Vol. 35 (2) , 243-266
https://doi.org/10.2307/2270517

Abstract

The first of this sequence of papers [21] surveyed the progress that has been made in embedding partially ordered sets as initial segments of the uncountable upper semilattice D of degrees of unsolvability. The principal concern of the present and subsequent parts will be with initial segments of the countable upper semilattice D (≦0⁽¹⁾) of degrees ≦0⁽¹⁾; a summary appeared in [21].

Keywords

This publication has 15 references indexed in Scilit:

Initial Segments of Turing Degrees
Proceedings of the London Mathematical Society, 1969
Distributive Initial Segments of the Degrees of Unsolvability
Mathematical Logic Quarterly, 1968
Recursively Enumerable Degrees and the Degrees Less Than 0(1)
Published by Elsevier ,1967
On the degrees of index sets
Transactions of the American Mathematical Society, 1966
The Recursively Enumerable Degrees are Dense
Annals of Mathematics, 1964
On the Degrees Less than 0
Annals of Mathematics, 1963
Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
The Journal of Symbolic Logic, 1958
TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
Proceedings of the National Academy of Sciences, 1957
On Degrees of Recursive Unsolvability
Annals of Mathematics, 1956
A theorem on hypersimple sets
Proceedings of the American Mathematical Society, 1954