Decidability and Invariant Classes for Degree Structures (original) (raw)
Related papers
2014
The Existential Theory of the Uppersemilattice of Turing Degrees with Least Element and Jump is
2006
Reducibility orderings: Theories, definability and automorphisms
Annals of Mathematical Logic, 1980
On minimal wtt-degrees and computably enumerable Turing degrees
2006
Decidability and Definability in the 0 -Enumeration Degrees
2005
The search for natural definability in the Turing degrees
Computability
Decidability and Definability in the 02Enumeration Degrees
Undecidability results for low complexity degree structures
Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, 1997
Uniform Definability and Undecidability in Classes of Structures
Xavier Vidaux, Thanases Pheidas
2010
The elementary theory of the recursively enumerable degrees is not 0-categorical
Advances in Mathematics, 1984
Undecidability in Weihrauch Degrees
Lecture Notes in Computer Science, 2010
Definability in the Recursively Enumerable Degrees
Bulletin of Symbolic Logic, 1996
On the jump classes of noncuppable enumeration degrees
The Journal of Symbolic Logic, 2011
Undecidability of local structures of s-degrees and Q-degrees
Chapter II: Embeddings and Extensions of Embeddings in the Degrees
1983
The Journal of Symbolic Logic, 1996
A Hierarchy of Computably Enumerable Degrees
The Bulletin of Symbolic Logic, 2018
On decidability and axiomatizability of some ordered structures
Soft Computing
Undecidability and 1-types in intervals of the computably enumerable degrees
Annals of Pure and Applied Logic, 2000
Undefinable classes and definable elements in models of set theory and arithmetic
Proceedings of The American Mathematical Society, 1988
Transactions of the American Mathematical Society, 1984
1 Definability in classes of finite structures
2011
Theoretical Computer Science, 1992
On the Decidability of the Existential Theory of
Interpretability and definability in the recursively enumerable degrees
Proceedings of the …, 1998
Decidable Fragments of the Simple Theory of Types with Infinity and NF
Notre Dame Journal of Formal Logic, 2017
Enumeration Reducibility and Computable Structure Theory
Computability and Complexity, 2016
Structures of the degrees of unsolvability of index sets
Algebra and Logic, 1979
On the ‘Definability of Definable’ Problem of Alfred Tarski
Mathematics
A ug 2 01 4 A definable E 0 class containing no definable elements
2014
Definable families of theories, related calculi and ranks
Sibirskie Elektronnye Matematicheskie Izvestiya, 2020
Undecidable problems for modal definability: Table 1
Journal of Logic and Computation, 2016
On relative enumerability of Turing degrees
Archive for Mathematical Logic, 2000
Definable Sets in Ordered Structures. I
Transactions of The American Mathematical Society, 1986