The number of nonequivalent computable indexations for a fixed family of sets

DOI10.1007/BF02260926zbMath0795.03059OpenAlexW2012572086MaRDI QIDQ1317638

S. L. Bereznyuk

Publication date: 12 April 1994

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02260926

zbMATH Keywords

reducibilityrecursively enumerable setscomputable indexations

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)

Related Items (1)

A generalization of Selivanov's theorem

Cites Work

• Regular elements in P. I.-rings
• Some examples in PI ring theory
• Rings of quotients of some semiprime. P.I. rings
• Rings with involution and chain conditions on bi-ideals
• Prime Rings Satisfying a Polynomial Identity
• Some results on the center of a ring with polynomial identity
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of nonequivalent computable indexations for a fixed family of sets