Computable limits and colimits in categories of partial enumerated sets
Andrzej Orlicki · Mathematical logic quarterly · 1993
Abstract 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.