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

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

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)

Cites Work

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

Cited In (11)

• Definability and elementary equivalence in the Ershov difference hierarchy
• A Characterisation of the Relations Definable in Presburger Arithmetic
• Equivalence structures and isomorphisms in the difference hierarchy
• Differences of Computably Enumerable Sets
• Title not available (Why is that?)
• Turing degrees of certain isomorphic images of computable relations
• ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
• Definable Filters in the Structure of Bounded Turing Reductions
• Elementary Differences Among Jump Hierarchies
• On relations between properties in transitive Turing machines
• Title not available (Why is that?)

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)