Irreducible, singular, and contiguous degrees

DOI10.1007/S10469-017-9439-4MaRDI QIDQ683370zbMATH OpenOpenAlexFDO

Authors I. I. Batyrshin

Publication date 6 February 2018

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10469-017-9439-4

zbMATH Keywords

\(m\)-reducibility\(Q\)-reducibilitycomputably enumerable degreescontiguous degreesirreducible degreessingular degrees

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Relations between certain reducibilities
• Embeddings in the Strong Reducibilities Between 1 and npm
• Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees
• scientific article; zbMATH DE number 3895050
• Contiguity and distributivity in the enumerable Turing degrees

Cites work

• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3564955 (Why is no real title available?)
• scientific article; zbMATH DE number 769946 (Why is no real title available?)
• A Completely Mitotic Nonrecursive R.E. Degree
• Algebraically closed groups
• Classical recursion theory. The theory of functions and sets of natural numbers.
• Classical recursion theory. Vol. II
• Complexity properties of recursively enumerable sets and \(bsQ\)-completeness
• Computably enumerable sets and quasi-reducibility
• Contiguity and distributivity in the enumerable Turing degrees
• Creative sets
• Degrees of denumerability reducibilities
• Higman's embedding theorem in a general setting and its application to existentially closed algebras
• Isolated 2-computably enumerable \(Q\)-degrees
• Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
• Linear orderings under one-one reducibility
• Non-isolated quasi-degrees
• One class of partial sets
• Positive equivalences
• Q-degrees of \(n\)-c.e. sets
• Quasi-completeness and functions without fixed-points
• Recursively Enumerable m - and tt -Degrees III: Realizing all Finite Distributive Lattices
• Recursively enumerable m- and tt-degrees. I: The quantity of m-degrees
• Relations between certain reducibilities
• Relationships Between Reducibilities
• Singleton enumeration reducibility and arithmetic
• Structural properties of \(Q\)-degrees of n-c.e. sets
• The weak truth table degrees of recursively enumerable sets
• Undecidability of local structures of s-degrees and Q-degrees
• \(Q _{1}\)-degrees of c.e. sets
• \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets
• \(\Delta\)\( ^ 0_ 2\) degrees and transfer theorems
• e- and s-degrees
• tt- and m-degrees
• w tt-Complete Sets are not Necessarily tt-Complete

Cited in

(4)

• On \(1\)-degrees inside \(m\)-degrees
• Priority arguments in the continuous r.e. degrees
• Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees
• scientific article; zbMATH DE number 769946 (Why is no real title available?)

This page was built for publication: Irreducible, singular, and contiguous degrees

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