A Polynomial Model for Logics with a Prime Power Number of Truth Values
This paper is concerned with a polynomial model (residue class ring) for a given q-valued propositional logic (where q is a power of a prime integer). This model allows to transfer logic problems into algebraic terms, resulting in an immediate computational approach to Knowledge Based Systems based on multi-valued logics. By means of this new approach, we have extended an already existent algebraic model to logics with a prime power number of truth values, while also getting more straightforward proofs and a more direct enunciation of the central theorem of this model.
multivalued logics groebner bases symbolic computing