Results 1  10
of
47
PairDense Relation Algebras
 Transactions of the American Mathematical Society
, 1991
"... The central result of this paper is that every pairdense relation algebra is completely representable. A relation algebra is said to be pairdense if every nonzero element below the identity contains a "pair". A pair is the relation algebraic analogue of a relation of the form fha; ai ; hb; big ..."
Abstract

Cited by 61 (8 self)
 Add to MetaCart
The central result of this paper is that every pairdense relation algebra is completely representable. A relation algebra is said to be pairdense if every nonzero element below the identity contains a "pair". A pair is the relation algebraic analogue of a relation of the form fha; ai ; hb; big (with a = b allowed). In a simple pairdense relation algebra, every pair is either a "point" (an algebraic analogue of fha; aig) or a "twin" (a pair which contains no point). In fact, every simple pairdense relation algebra A is completely representable over a set U iff jU j = + 2, where is the number of points of A and is the number of twins of A.
The Second Calculus of Binary Relations
 In Proceedings of MFCS'93
, 1993
"... We view the Chu space interpretation of linear logic as an alternative interpretation of the language of the Peirce calculus of binary relations. Chu spaces amount to Kvalued binary relations, which for K = 2 n we show generalize nary relational structures. We also exhibit a fourstage unique fa ..."
Abstract

Cited by 54 (18 self)
 Add to MetaCart
We view the Chu space interpretation of linear logic as an alternative interpretation of the language of the Peirce calculus of binary relations. Chu spaces amount to Kvalued binary relations, which for K = 2 n we show generalize nary relational structures. We also exhibit a fourstage unique factorization system for Chu transforms that illuminates their operation. 1 Introduction In 1860 A. De Morgan [DM60] introduced a calculus of binary relations equivalent in expressive power to one whose formulas, written in today's notation, are inequalities a b between terms a; b; . . . built up from variables with the operations of composition a; b, converse a, and complement a \Gamma . In 1870 C.S. Peirce [Pei33] extended De Morgan's calculus with Boolean connectives a + b and ab, Boolean constants 0 and 1, and an identity 1 0 for composition. In 1895 E. Schroder devoted a book [Sch95] to the calculus, and further extended it with the operations of reflexive transitive closure, a ...
The Origin of Relation Algebras in the Development and Axiomatization of the Calculus of Relations
, 1991
"... ..."
Relation algebras in qualitative spatial reasoning
 Fundamenta Informaticae
, 1999
"... The formalization of the “part – of ” relationship goes back to the mereology of S. Le´sniewski, subsequently taken up by Leonard & Goodman (1940), and Clarke (1981). In this paper we investigate relation algebras obtained from different notions of “part–of”, respectively, “connectedness” in various ..."
Abstract

Cited by 34 (13 self)
 Add to MetaCart
The formalization of the “part – of ” relationship goes back to the mereology of S. Le´sniewski, subsequently taken up by Leonard & Goodman (1940), and Clarke (1981). In this paper we investigate relation algebras obtained from different notions of “part–of”, respectively, “connectedness” in various domains. We obtain minimal models for the relational part of mereology in a general setting, and when the underlying set is an atomless Boolean algebra. 1
Dynamic Algebras as a wellbehaved fragment of Relation Algebras
 In Algebraic Logic and Universal Algebra in Computer Science, LNCS 425
, 1990
"... The varieties RA of relation algebras and DA of dynamic algebras are similar with regard to definitional capacity, admitting essentially the same equational definitions of converse and star. They differ with regard to completeness and decidability. The RA definitions that are incomplete with respect ..."
Abstract

Cited by 33 (5 self)
 Add to MetaCart
The varieties RA of relation algebras and DA of dynamic algebras are similar with regard to definitional capacity, admitting essentially the same equational definitions of converse and star. They differ with regard to completeness and decidability. The RA definitions that are incomplete with respect to representable relation algebras, when expressed in their DA form are complete with respect to representable dynamic algebras. Moreover, whereas the theory of RA is undecidable, that of DA is decidable in exponential time. These results follow from representability of the free intensional dynamic algebras. Dept. of Computer Science, Stanford, CA 94305. This paper is based on a talk given at the conference Algebra and Computer Science, Ames, Iowa, June 24, 1988. It will appear in the proceedings of that conference, to be published by SpringerVerlag in the Lecture Notes in Computer Science series. This work was supported by the National Science Foundation under grant number CCR8814921 ...
Peirce Algebras
, 1992
"... We present a twosorted 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 relationforming o ..."
Abstract

Cited by 25 (10 self)
 Add to MetaCart
We present a twosorted 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 relationforming operator on sets (the Peirce product of Boolean modules) and a setforming operator on relations (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 socalled terminological logics arising in knowledge representation have evolved a semantics best described as a calculus of relations interacting with sets.
Introductory Course on Relation Algebras, FiniteDimensional Cylindric Algebras, and Their Interconnections
 Algebraic Logic
, 1990
"... These are notes for a short course on relation algebras, finitedimensional cylindric algebras, and their interconnections, delivered at the Conference on Algebraic Logic, Budapest, Hungary, August 814, 1988, sponsored by the the Janos Bolyai Mathematical Society. ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
These are notes for a short course on relation algebras, finitedimensional cylindric algebras, and their interconnections, delivered at the Conference on Algebraic Logic, Budapest, Hungary, August 814, 1988, sponsored by the the Janos Bolyai Mathematical Society.
On a Formal Semantics of Tabular Expressions
 Science of Computer Programming
, 1997
"... In [15, 22, 25, 26] Parnas et al. advocate the use of relational model for documenting the intended behaviour of programs. In this method, tabular expressions (or tables) are used to improve readability so that formal documentation can replace conventional documentation. Parnas [23] describes sever ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
In [15, 22, 25, 26] Parnas et al. advocate the use of relational model for documenting the intended behaviour of programs. In this method, tabular expressions (or tables) are used to improve readability so that formal documentation can replace conventional documentation. Parnas [23] describes several classes of tables and provides their formal syntax and semantics. In this paper, an alternative, more general and more homogeneous semantics is proposed. The model covers all known types of tables used in Software Engineering. Contents 1 Introduction 2 2 Introductory examples 4 3 Relations 9 3.1 Cartesian Products, Functions, Relations . . . . . . . . . . . . . . . 9 3.2 Direct Products . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.3 InputOutput Relations . . . . . . . . . . . . . . . . . . . . . . . . . 12 4 Raw Table Skeleton 14 5 Cell Connection Graph and Medium Table Skeleton 15 6 Raw and Medium Table Elements 19 Supported by NSERC of Canada Grant 7 Well Do...
A Mechanised Proof System for Relation Algebra using Display Logic
 In Proc. JELIA98, LNAI
, 1997
"... . We describe an implementation of the Display Logic calculus for relation algebra as an Isabelle theory. Our implementation is the first mechanisation of any display calculus, but also provides a useful interactive proof assistant for relation algebra. The inference rules of Display Logic are coded ..."
Abstract

Cited by 16 (10 self)
 Add to MetaCart
. We describe an implementation of the Display Logic calculus for relation algebra as an Isabelle theory. Our implementation is the first mechanisation of any display calculus, but also provides a useful interactive proof assistant for relation algebra. The inference rules of Display Logic are coded directly as Isabelle theorems, thereby guaranteeing the correctness of all derivations. We describe various tactics and derived rules developed for simplifying proof search, including an automatic cutelimination procedure, and example theorems proved using Isabelle. We show how some relation algebraic theorems proved using our system can be put in the form of structural rules of Display Logic, facilitating later reuse. We then show how the implementation can be used to prove results comparing alternative formalizations of relation algebra from a prooftheoretic perspective. Keywords: logical frameworks, higherorder logic, relation algebra, display logic 1 Introduction Relation algebras a...