The Existential Theory of the Uppersemilattice of Turing Degrees with Least Element and Jump is (original) (raw)
Related papers
2014
Decidability and Invariant Classes for Degree Structures
Transactions of the American Mathematical Society, 1988
The search for natural definability in the Turing degrees
Computability
On the Decidability of the Existential Theory of
Ndjfl, 2008
On minimal wtt-degrees and computably enumerable Turing degrees
2006
On relative enumerability of Turing degrees
Archive for Mathematical Logic, 2000
Extensions of embeddings below computably enumerable degrees
Transactions of the American Mathematical Society, 2012
Chapter II: Embeddings and Extensions of Embeddings in the Degrees
1983
Mathematical Research Letters, 1999
The Journal of Symbolic Logic, 1996
On decidability and axiomatizability of some ordered structures
Soft Computing
Decidability and the finite model property
Journal of Philosophical Logic, 1981
Decidability and Definability in the 02Enumeration Degrees
Turing degrees and many-one degrees of maximal sets
Journal of Symbolic Logic, 1970
Weakly maximal decidable structures
RAIRO - Theoretical Informatics and Applications, 2008
On the jump classes of noncuppable enumeration degrees
The Journal of Symbolic Logic, 2011
Nonmaximal decidable structures
Journal of Mathematical Sciences, 2009
A computably stable structure with no Scott family of finitary formulas
Archive for Mathematical Logic - Arch. Math. Log., 2006
Enumerations in computable structure theory
Annals of Pure and Applied Logic, 2005
A Theorem of the Degree of Complexity of Some Sentential Logics
1980
Enumeration Reducibility and Computable Structure Theory
2017
Ordered structures and computability
2009
Embedding finite lattices into the computably enumerable degrees — a status survey
Cambridge University Press eBooks, 2017
Decidability and Definability in the 0 -Enumeration Degrees
2005
The elementary theory of the recursively enumerable degrees is not 0-categorical
Advances in Mathematics, 1984
Developments from Turing's Ideas in Logic, 2009
Turing jumps through provability
2015
Contiguity and distributivity in the enumerable Turing degrees
Journal of Symbolic Logic, 1997
1 Definability in classes of finite structures
2011
A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets
Transactions of the American Mathematical Society, 1980
The elementary theory of the natural lattice is finitely axiomatizable
Notre Dame Journal of Formal Logic - NDJFL, 1989
A Hierarchy of Computably Enumerable Degrees
The Bulletin of Symbolic Logic, 2018
Reducibility orderings: Theories, definability and automorphisms
Annals of Mathematical Logic, 1980
Turing Degrees and Automorphism Groups of Substructure Lattices
Algebra and Logic