- 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 I
Mathematical Logic Quarterly 17 (1):335-350 (1971)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
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.
Non‐Effectiveness in S. Orey's Arithmetical Compactness Theorem.R. G. Jeroslow - 1971 - Mathematical Logic Quarterly 17 (1):285-289.
Analytics
Added to PP
2016-02-04
Downloads
33 (#500,033)
6 months
6 (#588,512)
2016-02-04
Downloads
33 (#500,033)
6 months
6 (#588,512)
Historical graph of downloads
Citations of this work
Density of the cototal enumeration degrees.Joseph S. Miller & Mariya I. Soskova - 2018 - Annals of Pure and Applied Logic 169 (5):450-462.
A structural dichotomy in the enumeration degrees.Hristo A. Ganchev, Iskander Sh Kalimullin, Joseph S. Miller & Mariya I. Soskova - 2022 - Journal of Symbolic Logic 87 (2):527-544.
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
Relationships between computability-theoretic properties of problems.Rod Downey, Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey & Dan Turetsky - 2022 - Journal of Symbolic Logic 87 (1):47-71.
The jump operator on the ω-enumeration degrees.Hristo Ganchev & Ivan N. Soskov - 2009 - Annals of Pure and Applied Logic 160 (3):289-301.
References found in this work
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
Introduction to Metamathematics.Ann Singleterry Ferebee - 1968 - Journal of Symbolic Logic 33 (2):290-291.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
A criterion for completeness of degrees of unsolvability.Richard Friedberg - 1957 - Journal of Symbolic Logic 22 (2):159-160.
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-68866f4b87-7qn45 uwo