Generalized high degrees have the complementation property

by Noam Greenberg , Antonio Montalbán , Richard , A. Shore
Venue:Journal of Symbolic Logic
Citations:3 - 0 self

Documents Related by Co-Citation

4 On the ordering of classes in high/low hierarchies – M Lerman - 1984
73 Degrees of Unsolvability – M Lerman - 1983
19 Double jumps of minimal degrees – C G Jockusch, D B Posner - 1978
8 Jump embeddings in the Turing degrees – P G Hinman, T A Slaman - 1991
6 Simple proofs of some theorems on high degrees of unsolvability, Canadian – C G Jockusch - 1977
3 Degrees which do not bound minimal degrees – M Lerman - 1986
22 Automorphisms of the lattice of recursively enumerable sets, Part I: Maximal sets – R Soare - 1974
13 Minimal pairs and high recursively enumerable degrees – Barry Cooper - 1974
5 EMBEDDING JUMP UPPER SEMILATTICES INTO THE TURING DEGREES – Antonio Montalbán
475 Recursively Enumerable Sets and Degrees – R Soare - 1987
7 Initial segments of the degrees of size ℵ1 – Uri Abraham, Richard A Shore - 1986
3 On suborderings of degrees of recursive unsolvability. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik – Gerald E Sacks - 1961
6 Degree structures: Local and global investigations – Richard A. Shore
4 There is no ordering on the classes in the generalized high/low hierarchies – Antonio Montalbán
13 Decidability and invariant classes for degree structures – M Lerman, R A Shore - 1988
242 Renewal Theory – D R Cox - 1962
6 2003], Embedding and coding below a 1-generic degree – N Greenberg, A Montalbán
23 Distributive initial segments of the degrees of unsolvability, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 14 – A Lachlan - 1968
18 The theory of the degrees below 0 – Richard A. Shore - 1981