The Boolean algebra of logic
From MaRDI portal
Cites work
Cited in
(16)- Turing machine computations in finitely axiomatizable theories
- The Boolean algebra of the theory of linear orders
- Semantically universal classes of models
- The property of being a model complete theory is preserved by Cartesian extensions
- A.D. Taimanov and model theory in Kazakhstan
- Fine hierarchy and definable index sets
- Extension and interpretability
- First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories
- The Boolean algebra of piecewise testable languages
- Extension of relatively σ-additive probabilities on Boolean algebras of logic
- Confident and consistent partial learning of recursive functions
- Boolean sentence algebras: Isomorphism constructions
- THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS
- An uncountable Jónsson algebra in a minimal variety
- Universal Boolean algebras with applications to semantic classes of models
- Cartesian extensions and definition of the concept of model-theoretic property
This page was built for publication: The Boolean algebra of logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4087168)