English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Peirce Algebras

MPS-Authors
/persons/resource/persons44183

Brink,  Chris
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45401

Schmidt,  Renate A.
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dtz94
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Brink, C., Britz, K., & Schmidt, R. A. (1994). Peirce Algebras. Formal Aspects of Computing, 6(3), 339-358. doi:10.1007/BF01215410.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AD94-D
Abstract
We present a two-sorted algebra, called a {\em 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 {\em terminological logics} arising in knowledge
representation have evolved a semantics best described as a calculus of
relations interacting with sets.