Complexity of the index set of a constructive model

DOI10.1007/BF01979674MaRDI QIDQ797572zbMATH OpenFDO

Authors V. P. Dobritsa

Publication date 1983

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

Full work available at URL https://doi.org/10.1007/BF01979674

zbMATH Keywords

arithmetical hierarchycomputable classescomputable index functionconstructive modelsconstructive systemsindex set

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Hierarchies of computability and definability (03D55)

Review text

Translation from Algebra Logika 22, No.4, 372-381 (Russian) (1983; Zbl 0537.03022).

Cites work

• Autostability of models
• Autostability of models and Abelian groups
• scientific article; zbMATH DE number 3779289 (Why is no real title available?)
• scientific article; zbMATH DE number 3561335 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)

Cited in

(5)

• Index sets for some classes of structures
• Scott sentences for certain groups
• scientific article; zbMATH DE number 5379427 (Why is no real title available?)
• scientific article; zbMATH DE number 6262009 (Why is no real title available?)
• Computable numberings of the class of Boolean algebras with distinguished endomorphisms

This page was built for publication: Complexity of the index set of a constructive model

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