Relations between algorithmic reducibilities of algebraic systems

DOI10.3103/S1066369X09060103MaRDI QIDQ735978zbMATH OpenOpenAlexFDO

Authors Iskander 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

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

Cites work

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

Cited in

(3)

• Computable functors and effective interpretability
• On functors enumerating structures
• scientific article; zbMATH DE number 3943034 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735978)