Algorithmic degree of unars

DOI10.1007/BF01978402zbMath0684.03012MaRDI QIDQ1825186

B. M. Khusainov

Publication date: 1988

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

zbMATH Keywords

unarsconstructive modelsautoequivalenceconstructivizationreducibilitiesessential equivalence

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (3)

Existence and uniqueness of structures computable in polynomial time ⋮ Structures computable in polynomial time. II ⋮ Some applications of computable one-one numberings

Cites Work

• Autostability of models and Abelian groups
• Autostability of models
• Unnamed Item

This page was built for publication: Algorithmic degree of unars