Results 271 to 280 of about 2,863,239 (299)
Some of the next articles are maybe not open access.

The second calculus of binary relations

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 K-valued binary relations, which for K=2n we show generalize n-ary relational structures.
openaire   +1 more source

Postulates for the calculus of binary relations

Journal of Symbolic Logic, 1940
The theory of relations was discussed, along with the theory of classes, by Peirce and Schröder. While the calculus of classes has subsequently been presented (by Couturat, and by Huntington) as an abstract mathematical system, no similar formulation has been published of the calculus of relations.
openaire   +2 more sources

Complete Semigroups of Binary Relations

Journal of Mathematical Sciences, 2003
This paper considers the subgroups of the semigroup of binary relations \(B_X\) consisting of binary relations \(R\) whose sections \(S_x=\{y\mid(x,y)\in R\}\) are always members of a complete semilattice \(D\) of subsets of \(X\) under union. These semigroups can also be studied in terms of Boolean matrices and have applications to graph theory ...
openaire   +1 more source

Origins of the calculus of binary relations

[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, 2003
The genesis of the calculus of binary relations, which was introduced by A. De Morgan (1860) and was subsequently greatly developed by C.S. Peirce (1933) and E. Schroder (1895), is examined. Its further development, from the perspective of modern model theory, in the 1940s and 1950s is described. >
openaire   +2 more sources

Intervals of Binary Relations

Mathematical Logic Quarterly, 1979
openaire   +2 more sources

Axiomatizability of algebras of binary relations

2007
We present an overview of the axiomatizability problem of algebras of binary relations. The focus will be on the finite and non-finite axiomatizability of several fragments of Tarski’s class of representable relation algebras. We examine the step-by-step method for establishing finite axiomatizability and ultraproduct constructions for establishing non-
openaire   +1 more source

Home - About - Disclaimer - Privacy