Classes of finite relations as initial abstract data types. I (Q1179266): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Virgil Emil Căzănescu / rank | |||
Property / reviewed by | |||
Property / reviewed by: Boleslaw Wojdyło / rank | |||
Revision as of 01:02, 20 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Classes of finite relations as initial abstract data types. I |
scientific article |
Statements
Classes of finite relations as initial abstract data types. I (English)
0 references
26 June 1992
0 references
It is known that the finite functions and the finite partial functions form the initial algebraic theory and the initial pointed algebraic theory, respectively. The authors prove a similar result for a poorer algebraic structure. Axiomatizations for sixteen types of finite relations are given. These classes of relations are intersections of the following four basic classes of relations: total relations, surjective relations, partial functions and injective relations.
0 references
initial algebra
0 references
symmetric strict monoidal category
0 references
Axiomatizations
0 references
finite relations
0 references