Relations between algorithmic reducibilities of algebraic systems

DOI10.3103/S1066369X09060103zbMath1182.03074OpenAlexW2164834522MaRDI QIDQ735978

Iskander Sh. Kalimullin

Publication date: 26 October 2009

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x09060103

Mathematics Subject Classification ID

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

Related Items (2)

On functors enumerating structures ⋮ COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY

Cites Work

• Enumerations in computable structure theory
• Degrees of presentability of structures. I

This page was built for publication: Relations between algorithmic reducibilities of algebraic systems