A generalization of Selivanov's theorem

DOI10.1007/BF02104845zbMath0909.03037MaRDI QIDQ1358035

M. V. Gailit, S. L. Bereznyuk

Publication date: 25 March 1999

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

Turing reducibilityrecursively enumerable setscomputable enumerationssemilattice of equivalence classes

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Local classes and computable indexations
• The number of nonequivalent computable indexations for a fixed family of sets
• Unnamed Item

This page was built for publication: A generalization of Selivanov's theorem