Semilattices of computable indexations of classes of constructive models

DOI10.1007/BF01978690MaRDI QIDQ1114679zbMATH 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/BF01978690

zbMATH Keywords

computable indexings of families of constructive modelseffectively presented modelsGödel numbers of finite modelsindex setsemilattice of countable indexings

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Computable structure theory, computable model theory (03C57) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Review text

See the review in Zbl 0646.03041.

Cited in

(3)

• Computable classes of constructive models with non-limit-equivalent indexations
• The model companion of the class of pseudocomplemented semilattices is finitely axiomatizable
• The number of computable indexations of finite classes of constructive models

This page was built for publication: Semilattices of computable indexations of classes of constructive models

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