Paper Info
Title
The Power of Peircean Algebraic Logic (PAL)
Abstract
The existential graphs devised by Charles S. Peirce can be understood as an approach to represent and to work with relational structures long before the manifestation of relational algebras as known today in modern mathematics. Robert Burch proposed in (Bur91) an algebraization of the existential graphs and called it the Peircean Algebraic Logic (PAL). In this paper, we show that the expressive power of PAL is equivalent to the expressive power of Krasner-algebras (which extend relational algebras). Therefore, from the mathematical point of view these graphs can be considered as a two-dimensional representation language for first-order formulas. Furthermore, we investigate the special properties of the teridentity in this framework and Peirce's thesis, that to build all relations out of smaller ones we need at least a relation of arity three (for instance, the teridentity itself).
Year
DOI
Venue
2004
10.1007/978-3-540-24651-0_29
Lecture Notes in Artificial Intelligence
Keywords
Field
DocType
first order,algebraic logic,relation algebra,expressive power
Graph,Discrete mathematics,Arity,Existentialism,Algebra,Computer science,Algebraic logic,Representation language,Expressive power
Conference
Volume
ISSN
Citations 
2961
0302-9743
3
PageRank 
References 
Authors
0.58
3
2
Name
Order
Citations
PageRank
Joachim Hereth Correia11109.88
Reinhard Pöschel2309.36