Algorithmic degree of unars
From MaRDI portal
Publication:1825186
DOI10.1007/BF01978402zbMath0684.03012MaRDI QIDQ1825186
Publication date: 1988
Published in: Algebra and Logic (Search for Journal in Brave)
unars; constructive models; autoequivalence; constructivization; reducibilities; essential equivalence
03D30: Other degrees and reducibilities in computability and recursion theory
03C57: Computable structure theory, computable model theory
03D45: Theory of numerations, effectively presented structures
Related Items
Existence and uniqueness of structures computable in polynomial time, Some applications of computable one-one numberings, Structures computable in polynomial time. II
Cites Work