Irreducible, singular, and contiguous degrees

DOI10.1007/S10469-017-9439-4zbMATH Open1420.03095OpenAlexW2763576367MaRDI QIDQ683370FDOQ683370

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

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

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)

Cites Work

• Title not available (Why is that?)
• Classical recursion theory. Vol. II
• Classical recursion theory. The theory of functions and sets of natural numbers.
• One class of partial sets
• Computably enumerable sets and quasi-reducibility
• \(Q _{1}\)-degrees of c.e. sets
• Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
• The weak truth table degrees of recursively enumerable sets
• Positive equivalences
• e- and s-degrees
• Degrees of denumerability reducibilities
• Singleton enumeration reducibility and arithmetic
• Creative sets
• Undecidability of local structures of s-degrees and Q-degrees
• \(\Delta\)\( ^ 0_ 2\) degrees and transfer theorems
• Algebraically closed groups
• tt- and m-degrees
• Higman's embedding theorem in a general setting and its application to existentially closed algebras
• 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
• Title not available (Why is that?)
• Recursively Enumerable m - and tt -Degrees III: Realizing all Finite Distributive Lattices
• Contiguity and distributivity in the enumerable Turing degrees
• Title not available (Why is that?)
• Linear orderings under one-one reducibility
• Relationships Between Reducibilities
• Complexity properties of recursively enumerable sets and \(bsQ\)-completeness
• Q-degrees of \(n\)-c.e. sets
• Structural properties of \(Q\)-degrees of n-c.e. sets

Cited In (4)

• Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees
• On \(1\)-degrees inside \(m\)-degrees
• Priority arguments in the continuous r.e. degrees
• Title not available (Why is that?)

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)