Classes of recursively enumerable sets and Q-reducibility

DOI10.1007/BF01158060zbMATH Open0682.03027MaRDI QIDQ1823932FDOQ1823932

Authors: Roland Sh. Omanadze 

Publication date: 1989

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

zbMATH Keywords

Q-reducibilitynon-T-complete sets

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Semirecursive Sets and Positive Reducibility
• Recursively enumerable sets of positive integers and their decision problems
• Computational complexity, speedable and levelable sets
• On complexity properties of recursively enumerable sets
• On degrees of unsolvability and complexity properties
• Title not available (Why is that?)

Cited In (6)

• Representation theorems for recursively enumerable sets and a conjecture related to Poonen's large subring of \(\mathbb Q\)
• On a Class of Recursively Enumerable Sets
• Title not available (Why is that?)
• \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets
• Computably enumerable sets and quasi-reducibility
• 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)