Some Notions of Reducibility and Productiveness

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (1):17-44 (1965)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.19650110104

Links

PhilArchive



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

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

Some Notions of Reducibility and Productiveness.A. H. Lachlan - 1965 - Mathematical Logic Quarterly 11 (1):17-44.
Review: A. H. Lachlan, Some Notions of Reducibility and Productiveness. [REVIEW]Carl G. Jockusch - 1970 - Journal of Symbolic Logic 35 (3):478-478.
Supervenience, necessary coextensions, and reducibility.John Bacon - 1986 - Philosophical Studies 49 (March):163-76.
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
A New Reducibility between Turing‐ and wtt‐Reducibility.Sui Yuefei - 1994 - Mathematical Logic Quarterly 40 (1):106-110.
Borel reducibility and Hölder(α) embeddability between Banach spaces.Longyun Ding - 2012 - Journal of Symbolic Logic 77 (1):224-244.
A characterization of the Δ⁰₂ hyperhyperimmune sets.Roland Sh Omanadze & Andrea Sorbi - 2008 - Journal of Symbolic Logic 73 (4):1407-1415.
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.
Embeddings in the Strong Reducibilities Between 1 and npm.Phil Watson - 1997 - Mathematical Logic Quarterly 43 (4):559-568.
Bounds in the Turing reducibility of functions.Karol Habart & K. Habart - 1992 - Mathematical Logic Quarterly 38 (1):423-430.
Bounded enumeration reducibility and its degree structure.Daniele Marsibilio & Andrea Sorbi - 2012 - Archive for Mathematical Logic 51 (1-2):163-186.
Supervenience and reducibility: An odd couple.Ausonio Marras - 1994 - Philosophical Quarterly 44 (171):215-222.
Measures of kearnels of reducibility axioms and singlets.D. A. Bočvar - 1979 - Studia Logica 38 (4):393 - 400.

Analytics

Added to PP
2016-02-04

Downloads
24 (#620,575)

6 months
3 (#902,269)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

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

References found in this work

Introduction to metamathematics.Stephen Cole Kleene - 1952 - Groningen: P. Noordhoff N.V..
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Introduction to Metamathematics.H. Rasiowa - 1954 - Journal of Symbolic Logic 19 (3):215-216.

Add more references