On bQ₁-degrees of c.e. sets

DOI10.1002/MALQ.202300033MaRDI QIDQ6561650zbMATH OpenFDO

Authors Roland Sh. Omanadze, Irakli O. Chitaia

Publication date 25 June 2024

Published in Mathematical Logic Quarterly (MLQ) (Search for Journal in Brave)

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites work

• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3394122 (Why is no real title available?)
• A class of recursively enumerable sets
• A note on universal sets
• Computably enumerable sets and quasi-reducibility
• Hyperhypersimple sets and \(\mathrm{Q}_{1}\)-reducibility
• On complexity properties of recursively enumerable sets
• On subcreative sets and S-reducibility
• On the Degrees of Index Sets. II
• On the bounded quasi‐degrees of c.e. sets
• One class of partial sets
• \(Q _{1}\)-degrees of c.e. sets
• \(sQ_1\)-degrees of computably enumerable sets

This page was built for publication: On \(bQ_1\)-degrees of c.e. sets

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