The search for natural definability in the Turing degrees (original) (raw)
Related papers
On minimal wtt-degrees and computably enumerable Turing degrees
2006
Degrees which do not bound minimal degrees
Annals of Pure and Applied Logic, 1986
On relative enumerability of Turing degrees
Archive for Mathematical Logic, 2000
The Existential Theory of the Uppersemilattice of Turing Degrees with Least Element and Jump is
2006
Chapter XI: Bounding Minimal Degrees with Recursively Enumerable Degrees
1983
Jumps of Minimal Degrees Below 0
Journal of the London Mathematical Society, 1996
Decidability and Invariant Classes for Degree Structures
Transactions of the American Mathematical Society, 1988
A Hierarchy of Computably Enumerable Degrees
The Bulletin of Symbolic Logic, 2018
Decidability and Definability in the 0 -Enumeration Degrees
2005
Decidability and Definability in the 02Enumeration Degrees
Definability in the Recursively Enumerable Degrees
Bulletin of Symbolic Logic, 1996
Chapter IX: Minimal Degrees and High/Low Hierarchies
1983
Turing degrees and many-one degrees of maximal sets
Journal of Symbolic Logic, 1970
Undecidability in Weihrauch Degrees
Lecture Notes in Computer Science, 2010
Undecidability results for low complexity degree structures
Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, 1997
Chapter II: Embeddings and Extensions of Embeddings in the Degrees
1983
2014
Totally < ω-computably enumerable degrees and m-topped degrees
2007
Decomposition and infima in the computably enumerable degrees
The Journal of Symbolic Logic, 2003
The structure of the -degrees contained within a single -degree
Annals of Pure and Applied Logic, 2009
Embeddings into the computably enumerable degrees
Contemporary Mathematics, 2000
Transactions of the American Mathematical Society, 1984
The Theory of the Metarecursively Enumerable Degrees
2000
Extensions of embeddings below computably enumerable degrees
Transactions of the American Mathematical Society, 2012
Contiguity and distributivity in the enumerable Turing degrees
Journal of Symbolic Logic, 1997
Undecidability and 1-types in intervals of the computably enumerable degrees
Annals of Pure and Applied Logic, 2000
Reducibility orderings: Theories, definability and automorphisms
Annals of Mathematical Logic, 1980
On the Existence of a Strong Minimal Pair
Journal of Mathematical Logic, 2015
Chapter X: Jumps of Minimal Degrees
1983
On the jump classes of noncuppable enumeration degrees
The Journal of Symbolic Logic, 2011
On the Structure of Honest Elementary Degrees
Streamlined subrecursive degree theory
2011
Embedding Finite Lattices Into the Computably Enumerable Degrees — a Status Survey
Logic Colloquium, 2000
Minimal Degrees For Honest Polynomial Reducibilities
1984
Degree theoretic definitions of the low2 recursively enumerable sets
Journal of Symbolic Logic, 1995