Irreducible, singular, and contiguous degrees

DOI10.1007/S10469-017-9439-4zbMath1420.03095OpenAlexW2763576367MaRDI QIDQ683370

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

computably enumerable degreescontiguous degrees\(m\)-reducibility\(Q\)-reducibilityirreducible degreessingular degrees

Mathematics Subject Classification ID

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

Related Items (1)

On \(1\)-degrees inside \(m\)-degrees

Cites Work

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

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