Regular relations and bicartesian squares (Q1329746): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:57, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Regular relations and bicartesian squares |
scientific article |
Statements
Regular relations and bicartesian squares (English)
0 references
19 December 1994
0 references
A relation \(R\) is regular iff \(R=R*\widehat R*R\), where \(*\) indicates the relational composition and \(\widehat{R}\) is the inverse of \(R\). Regular relations arise in many areas of computer science and are characterized in a number of ways. The purpose of the paper is to recast the properties of regular relations in categorical terms. The result is that regular relations correspond to unique bicartesian squares in Set, where a bicartesian square in a category is a commutative square that is both a pushout and a pullback.
0 references
regular relations
0 references
bicartesian squares
0 references
programming theory
0 references