- 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
Properly Σ2 Enumeration Degrees
Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (6):491-522 (1988)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Properly Σ2 Enumeration Degrees.S. B. Cooper & C. S. Copestake - 1988 - Mathematical Logic Quarterly 34 (6):491-522.
Axt Paul. Enumeration and the Grzegorczyk hierarchy. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, Bd. 9 , S. 53–65. [REVIEW]Rózsa Péter - 1965 - Journal of Symbolic Logic 30 (1):90-91.
The first‐order theory of the c‐degrees.Paddy Farrinoton - 1984 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 30 (26‐29):437-446.
Enumeration of some classes of recursively enumerable sets.Kempachiro Ohashi - 1964 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 10 (1):1-6.
Marian Boykan Pour-El and Hilary Putnam. Recursively enumerable classes and their application to recursive sequences of formal theories. Archiv für mathematische Logik und Grundlagenforschung, vol. 8 no. 3–4 , pp. 104–121. - Marian Boykan Pour-El and William A. Howard. A structural criterion for recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 10 , pp. 105–114. - A. H. Lachlan. On recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 , pp. 209–220. - A. H. Lachlan. On recursive enumeration without repetition: a correction. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 13 , pp. 99–100. [REVIEW]James C. Owings - 1973 - Journal of Symbolic Logic 38 (1):155-156.
Analytics
Added to PP
2015-12-02
Downloads
33 (#682,921)
6 months
5 (#1,035,700)
2015-12-02
Downloads
33 (#682,921)
6 months
5 (#1,035,700)
Historical graph of downloads
Citations of this work
Cupping and noncupping in the enumeration degrees of ∑20 sets.S. Barry Cooper, Andrea Sorbi & Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (3):317-342.
Avoiding uniformity in the Δ 2 0 enumeration degrees.Liliana Badillo & Charles M. Harris - 2014 - Annals of Pure and Applied Logic 165 (9):1355-1379.
Cupping and definability in the local structure of the enumeration degrees.Hristo Ganchev & Mariya I. Soskova - 2012 - Journal of Symbolic Logic 77 (1):133-158.
The distribution of properly Σ20 e-degrees.Stanislaw Bereznyuk, Richard Coles & Andrea Sorbi - 2000 - Journal of Symbolic Logic 65 (1):19-32.
Splitting and nonsplitting II: A low {\sb 2$} C.E. degree about which ${\bf 0}'$ is not splittable.S. Barry Cooper & Angsheng Li - 2002 - Journal of Symbolic Logic 67 (4):1391-1430.
References found in this work
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
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-667477cd97-7qg25 dc2