Irreducible Truth-Value Algebras Suffice for the Completeness of Many First-Order Algebraic Logics
classification
🧮 math.LO
math-phmath.MPquant-ph
keywords
algebrasfirst-orderbooleanlogicalgebraiccompleteirreduciblemodel
read the original abstract
It is well-known that a Hilbert-style deduction system for first-order classical logic is sound and complete for a model theory built using all Boolean algebras as truth-value algebras if and only if it is sound and complete for a model theory utilizing only irreducible Boolean algebras (which are all isomorphic to the two-element Boolean algebra). In this paper, we prove an analogous result for any first-order logic with an algebraic semantics satisfying certain minimal assumptions, and we then apply our result to first-order quantum logic.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.