On Constructively Non‐Morphisms of Enumerated Sets and Constructive Non‐Reducibility of Enumerations

Mathematical Logic Quarterly 33 (6):485-496 (1987)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19870330603

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,438

External links

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

Through your library

My notes

Similar books and articles

Constructive and Locally Constructive Endofunctors on the Category of Enumerated Sets.Andrzej Orlicki - 1987 - Mathematical Logic Quarterly 33 (4):371-384.
Computable limits and colimits in categories of partial enumerated sets.Andrzej Orlicki - 1993 - Mathematical Logic Quarterly 39 (1):181-196.
Correction to “Strong Reducibilities of Enumerations and Partial Enumerated Algebras”.Andrzej Orlicki - 1989 - Mathematical Logic Quarterly 35 (1):95-95.
Ω-operations over partial enumerated sets.Andrzej Orlicki - 1993 - Mathematical Logic Quarterly 39 (1):551-558.
Strong Reducibilities of Enumerations and Partial Enumerated Algebras.A. Orlicki - 1988 - Mathematical Logic Quarterly 34 (2):143-162.
Counting the maximal intermediate constructive logics.Mauro Ferrari & Pierangelo Miglioli - 1993 - Journal of Symbolic Logic 58 (4):1365-1401.
On Lifting of Ω‐Operations From the Category of Sets to the Category of Enumerated Sets.Andrzej Orlicki - 1989 - Mathematical Logic Quarterly 35 (5):457-468.
On some categories of partial enumerated sets.Andrzej Orlicki - 1990 - Mathematical Logic Quarterly 36 (6):541-560.
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.
On Subcreative Sets and S-Reducibility.John T. Gill Iii & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669 - 677.
Some remarks on ω‐powers of enumerated sets and their applications to ω‐operations.Andrzej Orlicki - 1990 - Mathematical Logic Quarterly 36 (2):149-161.
Constructivity of Endofunctors on Categories of Partial Enumerated Sets II. Some Important Examples.Andrzej Orlicki - 1991 - Mathematical Logic Quarterly 37 (26‐30):439-452.
Constructivity of Endofunctors on Categories of Partial Enumerated Sets I. General Results.Andrzej Orlicki - 1991 - Mathematical Logic Quarterly 37 (19‐22):307-316.
Monotone reducibility and the family of infinite sets.Douglas Cenzer - 1984 - Journal of Symbolic Logic 49 (3):774-782.

Analytics

Added to PP
2013-12-01

Downloads
11 (#1,117,383)

6 months
2 (#1,229,212)

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

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references