Approximating Propositional Calculi by Finite-Valued Logics

The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few tautologies as possible. This has potential applications for representing (computationally complex) logics used in AI by (computationally easy) many-valued logics. It is investigated how far this method can be carried using (1) one or (2) an innite sequence of many-valued logics. It is shown that the optimal candidate matrices for (1) can be computed from the calculus.

• Type: Conference
• Year: 1994
• Where: ISMVL
• Authors: Matthias Baaz, Richard Zach
• Keywords: Calculus, Hardware, ISMVL 1994, Many-valued Logics, Propositional Calculus