Computable limits and colimits in categories of partial enumerated sets

Mathematical Logic Quarterly 39 (1):181-196 (1993)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Ω-operations over partial enumerated sets.Andrzej Orlicki - 1993 - Mathematical Logic Quarterly 39 (1):551-558.
On some categories of partial enumerated sets.Andrzej Orlicki - 1990 - Mathematical Logic Quarterly 36 (6):541-560.
The Settling-Time Reducibility Ordering.Barbara F. Csima & Richard A. Shore - 2007 - Journal of Symbolic Logic 72 (3):1055 - 1071.
Strong Reducibilities of Enumerations and Partial Enumerated Algebras.A. Orlicki - 1988 - Mathematical Logic Quarterly 34 (2):143-162.
Multimorphisms over enumerated sets.Andrzej Orlicki - 1993 - Notre Dame Journal of Formal Logic 34 (4):527-538.
Covariant Hom‐Functors on the Category of Enumerated Sets.Andrzej Orlicki - 1989 - Mathematical Logic Quarterly 35 (1):79-94.

Analytics

Added to PP
2013-12-01

Downloads
10 (#1,025,836)

6 months
1 (#1,040,386)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Constructivity of Endofunctors on Categories of Partial Enumerated Sets I. General Results.Andrzej Orlicki - 1991 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (19-22):307-316.

Add more references