- 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
The impossibility of finding relative complements for recursively enumerable degrees
Journal of Symbolic Logic 31 (3):434-454 (1966)
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
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices.Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp & Manuel Lerman - 1996 - Journal of Symbolic Logic 61 (3):880-905.
The role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
A limit on relative genericity in the recursively enumerable sets.Steffen Lempp & Theodore A. Slaman - 1989 - Journal of Symbolic Logic 54 (2):376-395.
The Sacks density theorem and Σ2-bounding.Marcia J. Groszek, Michael E. Mytilinaios & Theodore A. Slaman - 1996 - Journal of Symbolic Logic 61 (2):450 - 467.
Degrees of recursively enumerable sets which have no maximal supersets.A. H. Lachlan - 1968 - Journal of Symbolic Logic 33 (3):431-443.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
Recursively enumerable m- and tt-degrees. I: The quantity of m- degrees.R. G. Downey - 1989 - Journal of Symbolic Logic 54 (2):553-567.
Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
Analytics
Added to PP
2009-01-28
Downloads
28 (#574,430)
6 months
7 (#441,920)
2009-01-28
Downloads
28 (#574,430)
6 months
7 (#441,920)
Historical graph of downloads
Citations of this work
The weak truth table degrees of recursively enumerable sets.Richard E. Ladner & Leonard P. Sasso - 1975 - Annals of Mathematical Logic 8 (4):429-448.
Parameter definability in the recursively enumerable degrees.André Nies - 2003 - Journal of Mathematical Logic 3 (01):37-65.
Degree structures: Local and global investigations.Richard A. Shore - 2006 - Bulletin of Symbolic Logic 12 (3):369-389.
Definability in the recursively enumerable degrees.André Nies, Richard A. Shore & Theodore A. Slaman - 1996 - Bulletin of Symbolic Logic 2 (4):392-404.
Conjectures and questions from Gerald Sacks's Degrees of Unsolvability.Richard A. Shore - 1997 - Archive for Mathematical Logic 36 (4-5):233-253.
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-7c88c7cdf7-xpqc6 uwo