This paper contains some contributions to the study of Belnap's four-valued logic from an
algebraic point of view. We introduce a finite Hilbert-style axiomatization of this logic, along …

The calculus of relations has been an important component of the development of logic and
algebra since the middle of the nineteenth century, when Augustus De Morgan observed …

Fork algebras are a formalism based on the relational calculus, with interesting algebraic
and metalogical properties. Their representability is especially appealing in computer …

Since the main themes at the Helena Rasiowa memorial were algebra, logic and computer
science, we will present a survey of results on fork algebras from these points of view. In this …

Proper fork algebras are algebras of binary relations over a structured set. The underlying
set has changed from a set of pairs to a set closed under an injective function. In this paper …

Relational proof systems have been already proposed for certain modal, relevant and
substructural logics. In this paper we present a general method for constructing Rasiowa …

The development of programs from first-order specifications has as its main difficulty that of
dealing with universal quantifiers. This work is focused in that point, ie, in the construction of …

New successes in dealing with set theories by means of state-of-the-art theorem-provers
may ensue from terse and concise axiomatizations, such as can be moulded in the …

Refinement and Development of Programs from Relational Specifications Page 1 Electronic
Notes in Theoretical Computer Science 44 No. 3 (2003) URL: http://www.elsevier.nl/locate/entcs/volume44.html …

The connections between Tarski's Q-relation algebras and Thompson's groups F, T, V, and
monoid M are reviewed here, along with Jonsson-Tarski algebras, fork algebras, true pairing …