- 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
A survey of partial degrees
Journal of Symbolic Logic 40 (2):130-140 (1975)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Enumeration Reducibility and Partial Degrees.John Case - 1974 - Journal of Symbolic Logic 39 (3):605-606.
Partial degrees and the density problem.S. B. Cooper - 1982 - Journal of Symbolic Logic 47 (4):854-859.
Degrees of continuous functionals.Peter G. Hinman - 1973 - Journal of Symbolic Logic 38 (3):393-395.
Partial degrees and the density problem. Part 2: The enumeration degrees of the ∑2 sets are dense.S. B. Cooper - 1984 - Journal of Symbolic Logic 49 (2):503 - 513.
Review: John Case, Enumeration Reducibility and Partial Degrees. [REVIEW]Leonard P. Sasso - 1974 - Journal of Symbolic Logic 39 (3):605-606.
Partial Results Regarding Word Problems and Recursively Enumerable Degrees of Unsolvability.William W. Boone - 1963 - Journal of Symbolic Logic 28 (4):292-292.
John Case. Enumeration reducibility and partial degrees. Annals of mathematical logic, vol. 2 no. 4 , pp. 419–439.Leonard P. Sasso - 1974 - Journal of Symbolic Logic 39 (3):605-606.
The theory of the recursively enumerable weak truth-table degrees is undecidable.Klaus Ambos-Spies, André Nies & Richard A. Shore - 1992 - Journal of Symbolic Logic 57 (3):864-874.
Analytics
Added to PP
2009-01-28
Downloads
18 (#201,463)
6 months
1 (#1,912,481)
2009-01-28
Downloads
18 (#201,463)
6 months
1 (#1,912,481)
Historical graph of downloads
Citations of this work
Kolmogorov complexity and set theoretical representations of integers.Marie Ferbus-Zanda & Serge Grigorieff - 2006 - Mathematical Logic Quarterly 52 (4):375-403.
C-Quasi-Minimal enumeration degrees below c'.Boris Solon - 2006 - Archive for Mathematical Logic 45 (4):505-517.
Masstheoretische Ergebnisse für WT‐Grade.Friedrich Hebeisen - 1979 - Mathematical Logic Quarterly 25 (3-6):33-36.
References found in this work
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (7-13):117-125.
Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Mathematical Logic Quarterly 5 (7‐13):117-125.
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-5pqs9 uwo