scientific article; zbMATH DE number 1232433

MaRDI QIDQ4223080zbMATH OpenFDO

Authors A. N. Degtev

Publication date 13 December 1998

zbMATH Keywords

recursively enumerable setsreducibility of truth-table typetruth-table type degrees

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• scientific article; zbMATH DE number 4057497
• scientific article; zbMATH DE number 194103
• scientific article; zbMATH DE number 4091484
• Relations between reducibilities of table type
• Relations between table-type degrees

Cited in

(14)

• Tabular degrees in \(\alpha\)-recursion theory
• Partial degrees and \(r\)-degrees
• Interpreting true arithmetic in the theory of the r.e. truth table degrees
• Completeness criteria for a class of reducibilities
• sQ₁-degrees of computably enumerable sets
• Schnorr trivial sets and truth-table reducibility
• scientific article; zbMATH DE number 4057497 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• On the complexity of recurring sequences
• Complexity properties of recursively enumerable sets and bsQ-completeness
• Reducibility by means of almost polynomial functions
• Non-empty open intervals of computably enumerable sQ₁-degrees
• Conjunctive degrees and cylinders
• Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility

This page was built for publication:

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