Mathematical Logic Quarterly 11 (1):17-44 (1965)

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
DOI 10.1002/malq.19650110104
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,259
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Introduction to Metamathematics.Stephen Cole Kleene - 1952 - Princeton, NJ, USA: North Holland.

Add more references

Citations of this work BETA

On Subcreative Sets and S-Reducibility.John T. Gill & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669-677.
Polynomial Clone Reducibility.Quinn Culver - 2014 - Archive for Mathematical Logic 53 (1-2):1-10.

Add more citations

Similar books and articles

Supervenience, Necessary Coextensions, and Reducibility.John Bacon - 1986 - Philosophical Studies 49 (March):163-76.
A New Reducibility Between Turing‐ and Wtt‐Reducibility.Sui Yuefei - 1994 - Mathematical Logic Quarterly 40 (1):106-110.
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
Comparing Borel Reducibility and Depth of an Ω-Stable Theory.Martin Koerwien - 2009 - Notre Dame Journal of Formal Logic 50 (4):365-380.
On Definability in Multimodal Logic.Joseph Y. Halpern, Dov Samet & Ella Segev - 2009 - Review of Symbolic Logic 2 (3):451-468.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.
Bounded Enumeration Reducibility and its Degree Structure.Daniele Marsibilio & Andrea Sorbi - 2012 - Archive for Mathematical Logic 51 (1-2):163-186.
Bounds in the Turing Reducibility of Functions.Karol Habart & K. Habart - 1992 - Mathematical Logic Quarterly 38 (1):423-430.
Supervenience and Reducibility: An Odd Couple.Ausonio Marras - 1994 - Philosophical Quarterly 44 (171):215-222.

Analytics

Added to PP index
2013-11-24

Total views
13 ( #772,294 of 2,518,488 )

Recent downloads (6 months)
1 ( #408,186 of 2,518,488 )

How can I increase my downloads?

Downloads

My notes