On Finite-Valued Propositional Logical Calculi
Oleg M. Anshakov, S V Rychkov · Notre Dame Journal of Formal Logic · 1995
In this paper we describe, in a purely algebraic language, truth-complete finite-valued propositional logical calculi extending the classical Boolean calculus. We also give a new proof of the Completeness Theorem for such calculi. We investigate the quasi-varieties of algebras playing an analogous role in the theory of these finite-valued logics to the role played by the variety of Boolean algebras in classical logic.