Peirce algebras

C. Brink, K. Britz, R.A. Schmidt

Research output: Contribution to journalArticlepeer-review

Abstract

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 set-forming operator on relations (the Peirce product of Boolean modules) and a relation-forming operator on sets (a cylindrification operation). Two applications of Peirce algebras are given. The first points out that Peirce algebras provide a natural algebraic framework for modelling certain programming constructs. The second shows that the so-called terminological logics arising in knowledge representation have evolved a semantics best described as a calculus of relations interacting with sets.
Original languageEnglish
Pages (from-to)339-358
Number of pages20
JournalFormal Aspects of Computing
Volume6
Issue number3
DOIs
Publication statusPublished - 1 May 1994

Fingerprint

Dive into the research topics of 'Peirce algebras'. Together they form a unique fingerprint.

Cite this