- 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
Jump equivalence of the Δ2 0 hyperimmune sets
Journal of Symbolic Logic 37 (3):598-600 (1972)
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
Review: S. B. Cooper, Minimal Degrees and the Jump Operator. [REVIEW]David Posner - 1975 - Journal of Symbolic Logic 40 (1):86-87.
S. B. Cooper. Minimal degrees and the jump operator. The journal of symbolic logic, vol. 38 , pp. 249–271.David Posner - 1975 - Journal of Symbolic Logic 40 (1):86-87.
Scarpellini B.. A characterization of Δ2-sets. Transactions of the American Mathematical Society, vol. 117 , pp. 441–450. [REVIEW]Azriel Lévy - 1972 - Journal of Symbolic Logic 37 (1):193-193.
Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
Review: S. B. Cooper, T. A. Slaman, S. S. Wainer, Computability, Enumerability, Unsolvability, Directions in Recursion Theory. [REVIEW]C. T. Chong - 1999 - Journal of Symbolic Logic 64 (3):1362-1365.
On the jump classes of noncuppable enumeration degrees.Charles M. Harris - 2011 - Journal of Symbolic Logic 76 (1):177 - 197.
Goodness in the enumeration and singleton degrees.Charles M. Harris - 2010 - Archive for Mathematical Logic 49 (6):673-691.
Computable Reducibility of Equivalence Relations and an Effective Jump Operator.John D. Clemens, Samuel Coskey & Gianni Krakoff - forthcoming - Journal of Symbolic Logic:1-22.
Limits on jump inversion for strong reducibilities.Barbara F. Csima, Rod Downey & Keng Meng Ng - 2011 - Journal of Symbolic Logic 76 (4):1287-1296.
Analytics
Added to PP
2009-01-28
Downloads
34 (#123,329)
6 months
12 (#1,086,452)
2009-01-28
Downloads
34 (#123,329)
6 months
12 (#1,086,452)
Historical graph of downloads
Citations of this work
Asymptotic density and computably enumerable sets.Rodney G. Downey, Carl G. Jockusch & Paul E. Schupp - 2013 - Journal of Mathematical Logic 13 (2):1350005.
The degrees of bi-hyperhyperimmune sets.Uri Andrews, Peter Gerdes & Joseph S. Miller - 2014 - Annals of Pure and Applied Logic 165 (3):803-811.
Agreement reducibility.Rachel Epstein & Karen Lange - 2020 - Mathematical Logic Quarterly 66 (4):448-465.
References found in this work
Classes of Recursively Enumerable Sets and Degrees of Unsolvability.Donald A. Martin - 1966 - Mathematical Logic Quarterly 12 (1):295-310.
Recursively Enumerable Sets and Retracing Functions.C. E. M. Yates - 1962 - Mathematical Logic Quarterly 8 (3‐4):331-345.
Recursively Enumerable Sets and Retracing Functions.C. E. M. Yates - 1962 - Mathematical Logic Quarterly 8 (3-4):331-345.
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-s5tms uwo