A note on many·one reducibility

Journal of Symbolic Logic 28 (1):35-42 (1963)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

On Subcreative Sets and S-Reducibility.John T. Gill Iii & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669 - 677.
On the reducibility of relations: Variations on a theme of Peirce.Ernst Kleinert - 2007 - Transactions of the Charles S. Peirce Society 43 (3):509 - 520.
Supervenience, necessary coextensions, and reducibility.John Bacon - 1986 - Philosophical Studies 49 (March):163-76.
1-reducibility inside an m-degree with maximal set.E. Herrmann - 1992 - Journal of Symbolic Logic 57 (3):1046-1056.
Supervenience Doesn’t Entail Reducibility.Harold Kincaid - 1987 - Southern Journal of Philosophy 25 (3):343-56.
Supervenience and reducibility: An odd couple.Ausonio Marras - 1994 - Philosophical Quarterly 44 (171):215-222.

Analytics

Added to PP
2009-01-28

Downloads
26 (#610,935)

6 months
6 (#520,934)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Recursive well-founded orderings.Keh-Hsun Chen - 1978 - Annals of Mathematical Logic 13 (2):117-147.

Add more citations

References found in this work

Introduction to Metamathematics.Ann Singleterry Ferebee - 1968 - Journal of Symbolic Logic 33 (2):290-291.
Number theoretic concepts and recursive well-orderings.G. Kreisel, J. Shoenfield & Hao Wang - 1960 - Archive for Mathematical Logic 5 (1-2):42-64.

Add more references