2000 character limit reached
Irreducible Truth-Value Algebras Suffice for the Completeness of Many First-Order Algebraic Logics
Published 16 Jun 2016 in math.LO, math-ph, math.MP, and quant-ph | (1606.05330v3)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.