AbstractIt is shown that regular relations, which arise in a number of areas of programming theory, can be characterised in a variety of ways as pullbacks in Set; and up to isomorphism, as bicartesian squares in Set
The category Rel(Set) of sets and relations can be described as a category of spans and as the Kleis...
The category Rel(Set) of sets and relations can be described as a category of spans and as the Kleis...
The enterprise of comparing mathematical theorems according to their logical strength is an active a...
AbstractIt is shown that regular relations, which arise in a number of areas of programming theory, ...
summary:There exists a natural extension of the notion of preorder from binary relations onto relati...
summary:There exists a natural extension of the notion of preorder from binary relations onto relati...
AbstractIn their most general form, program specifications can be represented as binary relations. T...
AbstractA regular relation R, is one for which R = R ∘ R ^ ∘ R, where ∘ is relational composition an...
AbstractA regular relation R, is one for which R = R ∘ R ^ ∘ R, where ∘ is relational composition an...
The enterprise of comparing mathematical theorems according to their logical strength is an active a...
The enterprise of comparing mathematical theorems according to their logical strength is an active a...
We view languages of words over a product alphabet A x B as relations between words over A and words...
The notions of Lipschitz and bilipschitz mappings provide classes of mappings connected to the geome...
Many special classes of simplicial sets, such as the nerves of categories or groupoids, the 2-Segal ...
AbstractIn their most general form, program specifications can be represented as binary relations. T...
The category Rel(Set) of sets and relations can be described as a category of spans and as the Kleis...
The category Rel(Set) of sets and relations can be described as a category of spans and as the Kleis...
The enterprise of comparing mathematical theorems according to their logical strength is an active a...
AbstractIt is shown that regular relations, which arise in a number of areas of programming theory, ...
summary:There exists a natural extension of the notion of preorder from binary relations onto relati...
summary:There exists a natural extension of the notion of preorder from binary relations onto relati...
AbstractIn their most general form, program specifications can be represented as binary relations. T...
AbstractA regular relation R, is one for which R = R ∘ R ^ ∘ R, where ∘ is relational composition an...
AbstractA regular relation R, is one for which R = R ∘ R ^ ∘ R, where ∘ is relational composition an...
The enterprise of comparing mathematical theorems according to their logical strength is an active a...
The enterprise of comparing mathematical theorems according to their logical strength is an active a...
We view languages of words over a product alphabet A x B as relations between words over A and words...
The notions of Lipschitz and bilipschitz mappings provide classes of mappings connected to the geome...
Many special classes of simplicial sets, such as the nerves of categories or groupoids, the 2-Segal ...
AbstractIn their most general form, program specifications can be represented as binary relations. T...
The category Rel(Set) of sets and relations can be described as a category of spans and as the Kleis...
The category Rel(Set) of sets and relations can be described as a category of spans and as the Kleis...
The enterprise of comparing mathematical theorems according to their logical strength is an active a...
DOI
Add to ORKG