\(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets

DOI10.1134/S0037446614060032zbMath1325.03048OpenAlexW2462024731MaRDI QIDQ2352682

I. I. Batyrshin

Publication date: 3 July 2015

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0037446614060032

zbMATH Keywords

\(m\)-reducibility\(Q\)-reducibilitycomputably enumerable setsimple set

Mathematics Subject Classification ID

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

Related Items (3)

Irreducible, singular, and contiguous degrees ⋮ Fixed-point selection functions ⋮ On \(1\)-degrees inside \(m\)-degrees

Cites Work

• Unnamed Item
• 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
• Classical recursion theory. The theory of functions and sets of natural numbers
• Algebraically closed groups
• One class of partial sets
• Computably enumerable sets and quasi-reducibility
• Classical recursion theory. Vol. II
• Positive equivalences
• Isolated 2-computably enumerable \(Q\)-degrees
• Quasi-completeness and functions without fixed-points
• Non-isolated quasi-degrees
• T-Degrees, Jump Classes, and Strong Reducibilities
• Singleton enumeration reducibility and arithmetic
• Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets