z-logo
Premium
Computable limits and colimits in categories of partial enumerated sets
Author(s) -
Orlicki Andrzej
Publication year - 1993
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.19930390121
Subject(s) - mathematics , computable analysis , computable number , computable function , algebra over a field , pure mathematics , mathematical economics , discrete mathematics
Computable limits and colimits are “recursive counterparts” of the suitable classical concepts from category theory. We present mainly some interesting problems related to computable products. Moreover, some “computable counterparts” of well‐known classical facts from category theory are given. MSC: 03D45, 18A30.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here