Classes of recursively enumerable sets and Q-reducibility

DOI10.1007/BF01158060MaRDI QIDQ1823932zbMATH OpenFDO

Authors Roland Sh. Omanadze

Publication date 1989

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01158060

zbMATH Keywords

non-T-complete setsQ-reducibility

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Review text

See the review in Zbl 0665.03033.

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• Computational complexity, speedable and levelable sets
• scientific article; zbMATH DE number 3877165 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• On complexity properties of recursively enumerable sets
• On degrees of unsolvability and complexity properties
• Recursively enumerable sets of positive integers and their decision problems
• Semirecursive Sets and Positive Reducibility

Cited in

(6)

• Computably enumerable sets and quasi-reducibility
• \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets
• scientific article; zbMATH DE number 4059379 (Why is no real title available?)
• Representation theorems for recursively enumerable sets and a conjecture related to Poonen's large subring of Q
• On a Class of Recursively Enumerable Sets
• On reduction of the decision problem of recursively enumerable sets to the separability problem

This page was built for publication: Classes of recursively enumerable sets and Q-reducibility

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