ON WAYS OF CHARACTERIZING COMPLETE SETS

DOI10.1070/IM1992v038n02ABEH002197zbMath0743.03032OpenAlexW1999175002MaRDI QIDQ3980107

V. K. Bulitko

Publication date: 26 June 1992

Published in: Mathematics of the USSR-Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/im1992v038n02abeh002197

zbMATH Keywords

reducibilitycomplete setsproductive sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (6)

r‐Maximal sets and Q1,N‐reducibility ⋮ Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility ⋮ Completeness criteria for a class of reducibilities ⋮ On a general method of constructing post reducibilities and the corresponding completeness criteria ⋮ Complexity properties of recursively enumerable sets and \(bsQ\)-completeness ⋮ Complexity properties of recursively enumerable sets and \(sQ\)-completeness

This page was built for publication: ON WAYS OF CHARACTERIZING COMPLETE SETS