scientific article; zbMATH DE number 1302878
From MaRDI portal
Publication:4249364
surveyatomic modelBoolean algebradecidabilityconstructive modelalgorithmic complexityprime modelstable theoryfinitely axiomatizable theoriesLindenbaum algebrarigid model
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Classification theory, stability, and related concepts in model theory (03C45) Model-theoretic algebra (03C60) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Boolean algebras (Boolean rings) (06E99)
Cited in
(21)- Finitely inseparable first-order axiomatized mereotopological theories
- scientific article; zbMATH DE number 7566073 (Why is no real title available?)
- scientific article; zbMATH DE number 3918348 (Why is no real title available?)
- On constructive models of theories with linear Rudin-Keisler ordering
- scientific article; zbMATH DE number 4083594 (Why is no real title available?)
- Effective choice of constructivizations and recursive consistency of problems on constructive models
- scientific article; zbMATH DE number 5901619 (Why is no real title available?)
- scientific article; zbMATH DE number 3870639 (Why is no real title available?)
- scientific article; zbMATH DE number 1045790 (Why is no real title available?)
- Model theory under the axiom of determinateness
- A finite axiomatization of the set of strongly valid Ockhamist formulas
- scientific article; zbMATH DE number 4164815 (Why is no real title available?)
- scientific article; zbMATH DE number 1357400 (Why is no real title available?)
- A complete axiomatization of a theory with feature and arity constraints
- scientific article; zbMATH DE number 1531932 (Why is no real title available?)
- Finite axiomatizability and theories with trivial algebraic closure
- On Models Constructed by Means of the Arithmetized Completeness Theorem
- Groups of recursive automorphisms of constructive Boolean algebras
- AXIOMS FOR FINITE COLLAPSE MODELS OF ARITHMETIC
- New models of bounded induction axioms
- Destructibility and axiomatizability of Kaufmann models
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 Q4249364)
