Results 1  10
of
696,252
Binary Relations
, 2008
"... We would like to thank the many people who have made contributions of various kinds to the development of GAP since 1986, in particular: ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We would like to thank the many people who have made contributions of various kinds to the development of GAP since 1986, in particular:
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 63 (17 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
Involution Binary Relations
 THE 29TH WORKSHOP ON COMBINATORIAL MATHEMATICS AND COMPUTATION THEORY
"... This paper aims to investigate properties of strictly involution binary relations, which are generalizations of the classical notions of binary relations. We study the concepts of involution spanning subsets and give some examples related to different involution binary relations. Moreover, the invol ..."
Abstract
 Add to MetaCart
This paper aims to investigate properties of strictly involution binary relations, which are generalizations of the classical notions of binary relations. We study the concepts of involution spanning subsets and give some examples related to different involution binary relations. Moreover
PARTITIONED BINARY RELATIONS
"... We define the category of partitioned binary relations and show that it contains many classical diagram categories, including categories of binary relations, maps, injective maps, partitions, (oriented) Brauer diagrams and (oriented) TemperleyLieb diagrams. We construct a oneparameter deformatio ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We define the category of partitioned binary relations and show that it contains many classical diagram categories, including categories of binary relations, maps, injective maps, partitions, (oriented) Brauer diagrams and (oriented) TemperleyLieb diagrams. We construct a one
ON THE SEMIGROUP OF BINARY RELATIONS
, 1970
"... The concepts of row and column bases for an element of έ$x, the semigroup of binary relations on a set X, are introduced by interpreting a binary relation as a boolean matrix; these ideas are then used to characterize the Green's equivalences on &x. It is shown that the class of idempoten ..."
Abstract
 Add to MetaCart
The concepts of row and column bases for an element of έ$x, the semigroup of binary relations on a set X, are introduced by interpreting a binary relation as a boolean matrix; these ideas are then used to characterize the Green's equivalences on &x. It is shown that the class
Compressed Dynamic Binary Relations ∗
"... Abstract We introduce a dynamic data structure for the compact representation of binary relations R ⊆ A × B. Apart from checking whether two objects (a,b) ∈ A×B are related, and listing the objects of B related to some a ∈ A and vice versa, the structure allows inserting and deleting pairs (a,b) in ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Abstract We introduce a dynamic data structure for the compact representation of binary relations R ⊆ A × B. Apart from checking whether two objects (a,b) ∈ A×B are related, and listing the objects of B related to some a ∈ A and vice versa, the structure allows inserting and deleting pairs (a
Properties of Binary Relations
"... Term rewrite systems • a binary relation on the set of terms. • useful abstraction to study variety of things, functional programs, etc. • are defined by rules, each of which says when a certain term can be replaced by another. Example. A TRS specified by two rules. f(2n + 1) → f(3 ∗ (2n + 1) + 1) ..."
Abstract
 Add to MetaCart
Term rewrite systems • a binary relation on the set of terms. • useful abstraction to study variety of things, functional programs, etc. • are defined by rules, each of which says when a certain term can be replaced by another. Example. A TRS specified by two rules. f(2n + 1) → f(3 ∗ (2n + 1) + 1
Normal forms for binary relations
, 2006
"... We consider the representable equational theory of binary relations, in a language expressing composition, converse, and lattice operations. By working directly with a presentation of relation expressions as graphs we are able to define a notion of reduction which is confluent and strongly normalizi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider the representable equational theory of binary relations, in a language expressing composition, converse, and lattice operations. By working directly with a presentation of relation expressions as graphs we are able to define a notion of reduction which is confluent and strongly
Normal forms for binary relations
"... We consider the representable equational theory of binary relations, in a language expressing composition, converse, and lattice operations. By working directly with a presentation of relation expressions as graphs we are able to define a notion of reduction which is confluent and strongly normalizi ..."
Abstract
 Add to MetaCart
We consider the representable equational theory of binary relations, in a language expressing composition, converse, and lattice operations. By working directly with a presentation of relation expressions as graphs we are able to define a notion of reduction which is confluent and strongly
Results 1  10
of
696,252