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 …

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 …

In this paper it is shown that a broad class of propositional logics can be interpreted in an
equational logic based on fork algebras. This interpetability enables us to develop a fork …

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 …

Fork Algebras: Past, Present and Future Page 1 Journal on Relational Methods in Computer
Science, Vol. 1, 2004, pp. 181 - 216 Fork Algebras: Past, Present and Future Marcelo F. Frias⋆1 …

This paper is about pairing relation algebras as well as fork algebras and related subjects. In
the 1991-92 fork algebra papers it was conjectured that fork algebras admit a strong …

We consider classes of relation algebras expanded with new operations based on the
formation of ordered pairs. Examples for such algebras are pairing (or projection) algebras …