scientific article; zbMATH DE number 1232433

zbMath0914.03052MaRDI QIDQ4223080

A. N. Degtev

Publication date: 13 December 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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)

Related Items (6)

On the complexity of recurring sequences ⋮ Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility ⋮ Reducibility by means of almost polynomial functions ⋮ Completeness criteria for a class of reducibilities ⋮ \(sQ_1\)-degrees of computably enumerable sets ⋮ Complexity properties of recursively enumerable sets and \(bsQ\)-completeness

This page was built for publication: