- 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
Degrees of recursively enumerable sets which have no maximal supersets
Journal of Symbolic Logic 33 (3):431-443 (1968)
Abstract
This article has no associated abstract. (fix it)Other 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 orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
A. H. Lachlan. The impossibility of finding relative complements for recursively enumerable degrees. The journal of symbolic logic, vol. 31 , pp. 434–454. [REVIEW]Gerald E. Sacks - 1971 - Journal of Symbolic Logic 36 (3):539-540.
Lachlan A. H.. On some games which are relevant to the theory of recursively enumerable sets. Annals of mathematics, ser. 2 vol. 91 , pp. 291–310. [REVIEW]Gregory W. Jones - 1974 - Journal of Symbolic Logic 39 (2):345-345.
Lachlan A. H.. Lower bounds for pairs of recursively enumerable degrees. Proceedings of the London Mathematical Society, set. 3 vol. 16 part 3 , pp. 537–569. [REVIEW]Carl G. Jockosch - 1972 - Journal of Symbolic Logic 37 (3):611-611.
Some theorems on r-maximal sets and major subsets of recursively enumerable sets.Manuel Lerman - 1971 - Journal of Symbolic Logic 36 (2):193-215.
Analytics
Added to PP
2009-01-28
Downloads
30 (#606,804)
6 months
20 (#200,517)
2009-01-28
Downloads
30 (#606,804)
6 months
20 (#200,517)
Historical graph of downloads
Citations of this work
Highness and bounding minimal pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
On the definability of the double jump in the computably enumerable sets.Peter A. Cholak & Leo A. Harrington - 2002 - Journal of Mathematical Logic 2 (02):261-296.
Definable encodings in the computably enumerable sets.Peter A. Cholak & Leo A. Harrington - 2000 - Bulletin of Symbolic Logic 6 (2):185-196.
Definable properties of the computably enumerable sets.Leo Harrington & Robert I. Soare - 1998 - Annals of Pure and Applied Logic 94 (1-3):97-125.
Extending and interpreting Post’s programme.S. Cooper - 2010 - Annals of Pure and Applied Logic 161 (6):775-788.
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.
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-56b8889cb4-hcksh uwo