Hyperenumeration reducibility

Notre Dame Journal of Formal Logic 19 (3):405-415 (1978)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,169

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

Strong reducibility on hypersimple sets.T. G. McLaughlin - 1965 - Notre Dame Journal of Formal Logic 6 (3):229-234.
Bounds in weak truth-table reducibility.Karol Habart - 1991 - Notre Dame Journal of Formal Logic 32 (2):233-241.
Predicative Logic and Formal Arithmetic.John P. Burgess & A. P. Hazen - 1998 - Notre Dame Journal of Formal Logic 39 (1):1-17.
E and S4.Robert K. Meyer - 1970 - Notre Dame Journal of Formal Logic 11 (2):181-199.
Rescher on `e!'.George Englebretsen - 1975 - Notre Dame Journal of Formal Logic 16 (4):536-538.
A note on E.Aleksandar Kron - 1972 - Notre Dame Journal of Formal Logic 13 (3):424-426.

Analytics

Added to PP
2010-08-24

Downloads
29 (#861,538)

6 months
11 (#332,542)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Introenumerability, Autoreducibility, and Randomness.L. I. Ang - forthcoming - Journal of Symbolic Logic.
Reducibilities in two models for combinatory logic.Luis E. Sanchis - 1979 - Journal of Symbolic Logic 44 (2):221-234.

Add more citations

References found in this work

No references found.

Add more references