Complexity of index sets of calculable classes with a finite number of constructive systems

DOI10.1007/BF00969196zbMath0634.03040MaRDI QIDQ1096621

V. P. Dobritsa

Publication date: 1986

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

index setsconstructive modelalgebraic coding argumentsautoequivalentrecursive collections of Abelian groupsrecursive collections of recursive modelsrecursively isomorphic

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Unnamed Item

This page was built for publication: Complexity of index sets of calculable classes with a finite number of constructive systems