Two Proof Systems for Peirce Algebras
نویسندگان
چکیده
This paper develops and compares two tableaux-style proof systems for Peirce algebras. One is a tableau refutation proof system, the other is a proof system in the style of Rasiowa-Sikorski.
منابع مشابه
Representations as Full Peirce Algebras
Extended Abstract In this Note I prove a representation theorem for Peirce algebras introduced in Brink, Britz and Schmidt (1994b, 1994a). I show that the class of full Peirce algebras is characterised by the class of complete and atomic Peirce algebras in which the set of relational atoms is restricted by two conditions. One requires simplicity. The other requires that each relational element ...
متن کاملA modal characterization of Peirce algebras
Peirce algebras combine sets relations and various operations linking the two in a unifying setting This note o ers a modal perspective on Peirce algebras It uses modal logic to characterize the full Peirce algebras AMS Subject Classi cation B G G A CR Subject Classi cation F F I
متن کاملThe Logic of Peirce Algebras
Peirce algebras combine sets, relations and various operations linking the two in a unifying setting. This paper offers a modal perspective on Peirce algebras. Using modal logic a characterization of the full Peirce algebras is given, as well as a finite axiomatization of their equational theory that uses so-called unorthodox derivation rules. In addition, the expressive power of Peirce algebra...
متن کاملCongruences and ideals on Peirce algebras: a heterogeneous/homogeneous point of view
For a Peirce algebra P, lattices CongP of all heterogenous Peirce congruences and IdeP of all heterogenous Peirce ideals are presented. The notions of kernel of a Peirce congruence and the congruence induced by a Peirce ideal are introduced to describe an isomorphism between CongP and IdeP. This isomorphism leads us to conclude that the class of the Peirce algebras is ideal determined. Opposed ...
متن کاملMax - Planck - Institut Für Informatik
We present a two-sorted algebra, called a Peirce algebra, of relations and sets interacting with each other. In a Peirce algebra, sets can combine with each other as in a Boolean algebra, relations can combine with each other as in a relation algebra, and in addition we have both a relationforming operator on sets (the Peirce product of Boolean modules) and a set-forming operator on relations (...
متن کامل