- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Arithmetical Reducibilities II
Mathematical Logic Quarterly 18 (4‐6):83-92 (1972)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Arithmetical Reducibilities II.Alan L. Selman - 1972 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 18 (4-6):83-92.
Maximal Arithmetical Reducibilities.John Case - 1974 - Mathematical Logic Quarterly 20 (13‐18):261-270.
Strong Reducibilities of Enumerations and Partial Enumerated Algebras.A. Orlicki - 1988 - Mathematical Logic Quarterly 34 (2):143-162.
Correction to “Strong Reducibilities of Enumerations and Partial Enumerated Algebras”.Andrzej Orlicki - 1989 - Mathematical Logic Quarterly 35 (1):95-95.
Arithmetical Functions and Minimalization.George S. Boolos - 1974 - Mathematical Logic Quarterly 20 (23-24):353-354.
Arithmetical Sets and Retracing Functions.C. E. M. Yates - 1967 - Mathematical Logic Quarterly 13 (13-14):193-204.
Arithmetical Analogues of Productive and Universal Sets.Bruce M. Horowitz - 1982 - Mathematical Logic Quarterly 28 (14-18):203-210.
Non‐Effectiveness in S. Orey's Arithmetical Compactness Theorem.R. G. Jeroslow - 1971 - Mathematical Logic Quarterly 17 (1):285-289.
Analytics
Added to PP
2013-11-24
Downloads
18 (#826,262)
6 months
7 (#592,566)
2013-11-24
Downloads
18 (#826,262)
6 months
7 (#592,566)
Historical graph of downloads
Citations of this work
Generalizations of enumeration reducibility using recursive infinitary propositional sentences.C. J. Ash - 1992 - Annals of Pure and Applied Logic 58 (3):173-184.
On the Symmetric Enumeration Degrees.Charles M. Harris - 2007 - Notre Dame Journal of Formal Logic 48 (2):175-204.
References found in this work
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-kkm7k uwo