An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees (original) (raw)
Related papers
D -Simple Sets, Small Sets, and Degree Classes
Pacific Journal of Mathematics, 1980
Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1991
Degree theoretic definitions of the low2 recursively enumerable sets
Journal of Symbolic Logic, 1995
On the jump classes of noncuppable enumeration degrees
The Journal of Symbolic Logic, 2011
On suborderings of the α-recursively enumerable α-degrees
Annals of Mathematical Logic, 1972
Annals of Pure and Applied Logic, 2001
Totally < ω-computably enumerable degrees and m-topped degrees
2007
T-degrees, jump classes, and strong reducibilities
Transactions of the American Mathematical Society, 1987
Decomposition and infima in the computably enumerable degrees
The Journal of Symbolic Logic, 2003
2014
The Theory of the Metarecursively Enumerable Degrees
2000
Definability in the Recursively Enumerable Degrees
Bulletin of Symbolic Logic, 1996
Chapter II: Embeddings and Extensions of Embeddings in the Degrees
1983
Complementing cappable degrees in the difference hierarchy
Annals of Pure and Applied Logic, 2004
On relative enumerability of Turing degrees
Archive for Mathematical Logic, 2000
Some remarks about classes of recursively enumerable sets
Siberian Mathematical Journal, 1978
Recursively Enumerable m- and tt-Degrees III: Realizing all Finite Distributive Lattices
Journal of the London Mathematical Society, 1994
Structures of the degrees of unsolvability of index sets
Algebra and Logic, 1979
Theoretical Computer Science, 1992
Decidability and Invariant Classes for Degree Structures
Transactions of the American Mathematical Society, 1988
The structure of the -degrees contained within a single -degree
Annals of Pure and Applied Logic, 2009
Chapter XI: Bounding Minimal Degrees with Recursively Enumerable Degrees
1983
The elementary theory of the recursively enumerable degrees is not 0-categorical
Advances in Mathematics, 1984
Definable degrees and automorphisms of mathcalD\mathcal {D}mathcalD
Bulletin of the American Mathematical Society, 1981
Embeddings into the computably enumerable degrees
Contemporary Mathematics, 2000
Computably enumerable sets and quasi-reducibility
Annals of Pure and Applied Logic, 1998
Degrees which do not bound minimal degrees
Annals of Pure and Applied Logic, 1986
Embedding finite lattices into the computably enumerable degrees — a status survey
Cambridge University Press eBooks, 2017
A Hierarchy of Computably Enumerable Degrees
The Bulletin of Symbolic Logic, 2018
Chapter IX: Minimal Degrees and High/Low Hierarchies
1983
Hierarchies of Sets and Degrees Below 0
1979
Extensions of embeddings below computably enumerable degrees
Transactions of the American Mathematical Society, 2012
Journal of Symbolic Logic, 1989
On minimal wtt-degrees and computably enumerable Turing degrees
2006