- 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 strong anticupping property for recursively enumerable degrees
Journal of Symbolic Logic 54 (2):527-539 (1989)
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.
Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
Splitting theorems for speed-up related to order of enumeration.A. M. Dawes - 1982 - Journal of Symbolic Logic 47 (1):1-7.
The role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.
A limit on relative genericity in the recursively enumerable sets.Steffen Lempp & Theodore A. Slaman - 1989 - Journal of Symbolic Logic 54 (2):376-395.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
Generalized nonsplitting in the recursively enumerable degrees.Steven D. Leonhardi - 1997 - Journal of Symbolic Logic 62 (2):397-437.
Recursively enumerable m- and tt-degrees. I: The quantity of m- degrees.R. G. Downey - 1989 - Journal of Symbolic Logic 54 (2):553-567.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Analytics
Added to PP
2009-01-28
Downloads
46 (#352,153)
6 months
10 (#299,297)
2009-01-28
Downloads
46 (#352,153)
6 months
10 (#299,297)
Historical graph of downloads
Citations of this work
Dynamic notions of genericity and array noncomputability.Benjamin Schaeffer - 1998 - Annals of Pure and Applied Logic 95 (1-3):37-69.
Intervals containing exactly one c.e. degree.Guohua Wu - 2007 - Annals of Pure and Applied Logic 146 (1):91-102.
Computability and the Symmetric Difference Operator.Uri Andrews, Peter M. Gerdes, Steffen Lempp, Joseph S. Miller & Noah D. Schweber - 2022 - Logic Journal of the IGPL 30 (3):499-518.
References found in this work
Complementing below recursively enumerable degrees.S. Barry Cooper & Richard L. Epstein - 1987 - Annals of Pure and Applied Logic 34 (1):15-32.
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-547967878c-4r8xz uwo