\(sQ_1\)-degrees of computably enumerable sets
From MaRDI portal
Publication:2700830
DOI10.1007/s00153-022-00847-1OpenAlexW4295995900WikidataQ114231459 ScholiaQ114231459MaRDI QIDQ2700830
Publication date: 27 April 2023
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-022-00847-1
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- \(Q _{1}\)-degrees of c.e. sets
- Strong enumeration reducibilities
- Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility
- A class of recursively enumerable sets
- Classical recursion theory. The theory of functions and sets of natural numbers
- One class of partial sets
- Complexity properties of recursively enumerable sets and \(sQ\)-completeness
- Computably enumerable sets and quasi-reducibility
- On \(sQ\)-completeness of recursively enumerable sets
- Higman's embedding theorem in a general setting and its application to existentially closed algebras
- Upper semilattice of recursively enumerable sQ-degrees
- Degree structures of conjunctive reducibility
- Hyperhypersimple sets and Q1 -reducibility
- On subcreative sets and S-reducibility
- On complexity properties of recursively enumerable sets
- Some structural properties of quasi-degrees
- On the Degrees of Index Sets. II
- Semirecursive Sets and Positive Reducibility
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: \(sQ_1\)-degrees of computably enumerable sets