Definable relations in Turing degree structures

DOI10.3103/S1066369X1402011XzbMATH Open1327.03031OpenAlexW2011995303WikidataQ128145798 ScholiaQ128145798MaRDI QIDQ468086FDOQ468086

Authors M. M. Arslanov

Publication date 5 November 2014

Published in Russian Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/s1066369x1402011x

zbMATH Keywords

definable relationscomputably enumerable setsErshov difference hierarchyhigh degreesmajor subsetsTuring degrees of unsolvability

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Recommendations

• On the problem of definability of the computably enumerable degrees in the difference hierarchy
• Model-theoretic properties of the \(n\)-c.e. degrees
• scientific article; zbMATH DE number 1531930
• Definability and elementary equivalence in the Ershov difference hierarchy
• Definability in the Turing degrees

Cites work

• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• Automorphisms of the lattice of recursively enumerable sets
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Differences of Computably Enumerable Sets
• ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
• On the degrees less than 0'
• Some theorems on R-maximal sets and major subsets of recursively enumerable sets
• The Ershov hierarchy
• The nonlow computably enumerable degrees are not invariant in \(\mathcal{E}\)
• The Δ₃⁰-automorphism method and noninvariant classes of degrees

Cited in

(17)

• Definable Filters in the Structure of Bounded Turing Reductions
• Differences of Computably Enumerable Sets
• Definability and elementary equivalence in the Ershov difference hierarchy
• Computability and the symmetric difference operator
• A hierarchy of computably enumerable degrees
• On relations between properties in transitive Turing machines
• Turing degrees of certain isomorphic images of computable relations
• scientific article; zbMATH DE number 125241 (Why is no real title available?)
• Equivalence structures and isomorphisms in the difference hierarchy
• scientific article; zbMATH DE number 1531934 (Why is no real title available?)
• Rice sequences of relations
• A Characterisation of the Relations Definable in Presburger Arithmetic
• ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
• Elementary Differences Among Jump Hierarchies
• Minimal predicates for \(\Delta \)-definability
• On the problem of definability of the computably enumerable degrees in the difference hierarchy
• The search for natural definability in the Turing degrees

This page was built for publication: Definable relations in Turing degree structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q468086)