Complexity of the index set of a constructive model

DOI10.1007/BF01979674zbMATH Open0545.03016MaRDI QIDQ797572

V. P. Dobritsa

Publication date: 1983

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

zbMATH Keywords

index setarithmetical hierarchyconstructive modelscomputable classescomputable index functionconstructive systems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Autostability of models and Abelian groups
• Autostability of models

Related Items (5)

Title not available (Why is that?) ⋮ Computable numberings of the class of Boolean algebras with distinguished endomorphisms ⋮ Scott sentences for certain groups ⋮ Index sets for some classes of structures ⋮ Title not available (Why is that?)

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)