Conditionally Reversible Computations and Weak Universality in Category Theory - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Mathematical Sciences Année : 2014

Conditionally Reversible Computations and Weak Universality in Category Theory

Résumé

The main attention is directed to the notion of weak universality in category theory. While the definitions based on the ordinary universal constructions usually hold up to isomorphisms, that is, unconditionally reversible arrows, weakly universal constructions may be seen “positively” as defined up to conditionally reversible arrows. It is shown that weak universality is closely related to intensional equality, typically considered in categories used in computer science. As a possible application of weakly universal categorical constructions we suggest the notion of a conditionally reversible computation in the theory of computations. Bibliography: 6 titles.
Fichier non déposé

Dates et versions

hal-03224138 , version 1 (11-05-2021)

Identifiants

Citer

Sergey Baranov, Sergei Soloviev. Conditionally Reversible Computations and Weak Universality in Category Theory. Journal of Mathematical Sciences, 2014, 200, pp.654-661. ⟨10.1007/s10958-014-1955-3⟩. ⟨hal-03224138⟩
16 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More