Lattice-Based Paraconsistent Logic

In this paper we describe a procedure for developing models and associated proof systems for two styles of paraconsistent logic. We first give an Urquhart-style representation of bounded not necessarily discrete lattices using (grill, cogrill) pairs. From this we develop Kripke semantics for a logic permitting 3 truth values: true, false and both true and false. We then enrich the lattice by adding a unary operation of negation that is …