Multimorphisms over enumerated sets

Notre Dame Journal of Formal Logic 34 (4):527-538 (1993)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093633904

Other Versions

No versions found

Links

PhilArchive

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

The meta-r.E. Sets, but not the π11 sets, can be enumerated without repetition.James C. Owings - 1970 - Journal of Symbolic Logic 35 (2):223 - 229.
Sets and Point-Sets: Five Grades of Set-Theoretic Involvement in Geometry.John P. Burgess - 1988 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:456-463.
On Subcreative Sets and S-Reducibility.John T. Gill Iii & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669 - 677.
Orbits of hyperhypersimple sets and the lattice of ∑03 sets.E. Herrmann - 1983 - Journal of Symbolic Logic 48 (3):693 - 699.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
How Spinoza enumerated the Affects.Stephen H. Voss - 1981 - Archiv für Geschichte der Philosophie 63 (2):167-179.
The ordertype of β-r.E. Sets.Klaus Sutner - 1990 - Journal of Symbolic Logic 55 (2):573-576.
Indifferent sets for genericity.Adam R. Day - 2013 - Journal of Symbolic Logic 78 (1):113-138.

Analytics

Added to PP
2010-08-24

Downloads
42 (#1,335,624)

6 months
5 (#1,609,967)

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

No references found.

Add more references