Structural properties of computable classes of contructive models

DOI10.1007/BF01978382MaRDI QIDQ1108262zbMATH OpenFDO

Authors V. P. Dobritsa

Publication date 1987

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

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

zbMATH Keywords

arithmetical complexityarithmetical hierarchycomputable indexingconstructivizationeffectively presented modelsfinite modelsindex sets

Mathematics Subject Classification ID

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

Review text

See the review in Zbl 0636.03030.

Cites work

• A universal semigroup
• scientific article; zbMATH DE number 3853049 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3342831 (Why is no real title available?)

Cited in

(5)

• Effective choice of constructivizations and recursive consistency of problems on constructive models
• The parsimony principle for a class of model structures
• scientific article; zbMATH DE number 3918348 (Why is no real title available?)
• Structural properties for feasibly computable classes of type two
• Characteristic properties of equivalent structures in compositional models

This page was built for publication: Structural properties of computable classes of contructive models

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