Computable limits and colimits in categories of partial enumerated sets

✍ Scribed by Andrzej Orlicki

• Publisher: John Wiley and Sons
• Year: 1993
• Tongue: English
• Weight: 931 KB
• Volume: 39
• Category: Article
• ISSN: 0044-3050
• DOI: 10.1002/malq.19930390121

✦ Synopsis

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.