Stipulations,multivaluedlogic,andDeMorganalgebras.PDFVIP

Stipulations, multivalued logic, and De Morgan algebras J. Berman and W. J. Blok Department of Mathematics, Statistics, and Computer Science University of Illinois at Chicago Chicago, IL 60607 U.S.A. Dedicated to Professor Ivo Rosenberg on the occasion of his sixty-fifth birthday Abstract A stipulation s is a map from a set Pr of propositional constants into the sentence algebra generated by that set. Given an algebra A of ¯ truth values a valuation f : Pr → A is s-consistent if f (p) = f (s(p)), ¯ for all p ∈ Pr, where f is the natural extension of f to the sentence algebra. If there is a partial order (an “information order”) ≤ on the domain of the algebra that is preserved by its fundamental operations, then the set of s-consistent valuations into the algebra is also a (non- empty) poset. Natural completeness properties of the partial order transfer to this poset (Theorem 3.7), and if the algebra is in addition order-complete with respect to the partial order the finite posets of s- consistent valuations can be characterized (Theorem 3.8). The results are applied and refined in the case A is the three-element Kleene alge- bra (Section 4) and the four-element De Morgan algebra (Section 5). The facts about the clones of operations needed for this are known in the Kleene case, and are provided for the De Morgan case: the four- element De Morgan algebra with all four constants added to its type is order-complete with respect to a lattice order (Theorem 5.2), while the clone of operations of the four-element De Mo