- 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
On the Cantor-bendixon rank of recursively enumerable sets
Journal of Symbolic Logic 58 (2):629-640 (1993)
Abstract
The main result of this paper is to show that for every recursive ordinal α ≠ 0 and for every nonrecursive r.e. degree d there is a r.e. set of rank α and degree dOther Versions
No versions found
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
On the ranked points of a Π1 0 set.Douglas Cenzer & Rick L. Smith - 1989 - Journal of Symbolic Logic 54 (3):975-991.
Countable thin Π01 classes.Douglas Cenzer, Rodney Downey, Carl Jockusch & Richard A. Shore - 1993 - Annals of Pure and Applied Logic 59 (2):79-139.
On the r.e. predecessors of d.r.e. degrees.Shamil Ishmukhametov - 1999 - Archive for Mathematical Logic 38 (6):373-386.
Definability in the recursively enumerable degrees.André Nies, Richard A. Shore & Theodore A. Slaman - 1996 - Bulletin of Symbolic Logic 2 (4):392-404.
Degrees of categoricity of trees and the isomorphism problem.Mohammad Assem Mahmoud - 2019 - Mathematical Logic Quarterly 65 (3):293-304.
Rank and randomness.Rupert Hölzl & Christopher P. Porter - 2019 - Journal of Symbolic Logic 84 (4):1527-1543.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Array nonrecursiveness and relative recursive enumerability.Mingzhong Cai - 2012 - Journal of Symbolic Logic 77 (1):21-32.
Kleene index sets and functional m-degrees.Jeanleah Mohrherr - 1983 - Journal of Symbolic Logic 48 (3):829-840.
Domination, forcing, array nonrecursiveness and relative recursive enumerability.Mingzhong Cai & Richard A. Shore - 2012 - Journal of Symbolic Logic 77 (1):33-48.
Analytics
Added to PP
2009-01-28
Downloads
61 (#354,025)
6 months
17 (#183,832)
2009-01-28
Downloads
61 (#354,025)
6 months
17 (#183,832)
Historical graph of downloads
Citations of this work
The members of thin and minimal Π 1 0 classes, their ranks and Turing degrees.Rodney G. Downey, Guohua Wu & Yue Yang - 2015 - Annals of Pure and Applied Logic 166 (7-8):755-766.
Degrees containing members of thin Π10 classes are dense and co-dense.Rodney G. Downey, Guohua Wu & Yue Yang - 2018 - Journal of Mathematical Logic 18 (1):1850001.
A Rank One Cohesive Set. Downey & Yang Yue - 1994 - Annals of Pure and Applied Logic 68 (2):161-171.
References found in this work
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Members of countable π10 classes.Douglas Cenzer, Peter Clote, Rick L. Smith, Robert I. Soare & Stanley S. Wainer - 1986 - Annals of Pure and Applied Logic 31:145-163.
Countable thin Π01 classes.Douglas Cenzer, Rodney Downey, Carl Jockusch & Richard A. Shore - 1993 - Annals of Pure and Applied Logic 59 (2):79-139.
On $\Pi^0_1$ classes and their ranked points.Rod Downey - 1991 - Notre Dame Journal of Formal Logic 32 (4):499-512.
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-648784bb4d-2w72m uwo