scientific article; zbMATH DE number 1302871
algebraic complexityconstructivizable modeldecidabilitydecidable Boolean algebrastrongly constructivizable modelsurvey
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Computable structure theory, computable model theory (03C57) Model-theoretic algebra (03C60) Theory of numerations, effectively presented structures (03D45) Boolean algebras (Boolean rings) (06E99)
The authors consider the algebraic complexity of relations defined on algebraic structures. In Section 1, decidability of basic relations and of elementary properties of structures is discussed. In Section 2, the existence problem for decidable models with given model-theoretic properties is under consideration. Decidable Boolean algebras with particular emphasis on the existence of strongly constructive elementary extensions are studied in Section 3. For the entire collection see [Zbl 0905.03001].
- On the spectrum of degrees of decidable relations
- Degree spectra of relations on structures of finite computable dimension
- Explicit algebraic models for constructive and classical theories with non-standard elements
- Constructibility and decidability versus domain independence and absoluteness
- Degrees of autostability relative to strong constructivizations
- scientific article; zbMATH DE number 3843733 (Why is no real title available?)
- scientific article; zbMATH DE number 4039845 (Why is no real title available?)
- scientific article; zbMATH DE number 4039865 (Why is no real title available?)
- scientific article; zbMATH DE number 57854 (Why is no real title available?)
- scientific article; zbMATH DE number 1302878 (Why is no real title available?)
- scientific article; zbMATH DE number 1302879 (Why is no real title available?)
- scientific article; zbMATH DE number 4118557 (Why is no real title available?)
- Decidability of the restricted theories of a class of partial orders
- Strongly constructive Boolean algebras
- Elementary pairs of models
- The most nonelementary theory
- The Tarski-Lindenbaum algebra of the class of strongly constructivizable models with -stable theories
- Groups of recursive automorphisms of constructive Boolean algebras
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249357)