- 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 density of the nonbranching degrees
Annals of Pure and Applied Logic 24 (2):113-130 (1983)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Density of the cototal enumeration degrees.Joseph S. Miller & Mariya I. Soskova - 2018 - Annals of Pure and Applied Logic 169 (5):450-462.
Intervals and sublattices of the R.E. weak truth table degrees, part I: Density.R. G. Downey - 1989 - Annals of Pure and Applied Logic 41 (1):1-26.
The density of infima in the recursively enumerable degrees.Theodore A. Slaman - 1991 - Annals of Pure and Applied Logic 52 (1-2):155-179.
Minimal degrees recursive in 1-generic degrees.C. T. Chong & R. G. Downey - 1990 - Annals of Pure and Applied Logic 48 (3):215-225.
Degrees which do not bound minimal degrees.Manuel Lerman - 1986 - Annals of Pure and Applied Logic 30 (3):249-276.
Categoricity in hyperarithmetical degrees.C. J. Ash - 1987 - Annals of Pure and Applied Logic 34 (1):1-14.
Generic degrees are complemented.Masahiro Kumabe - 1993 - Annals of Pure and Applied Logic 59 (3):257-272.
Empty intervals in the enumeration degrees.Thomas F. Kent, Andrew Em Lewis & Andrea Sorbi - 2012 - Annals of Pure and Applied Logic 163 (5):567-574.
Analytics
Added to PP
2014-01-16
Downloads
37 (#444,147)
6 months
6 (#588,321)
2014-01-16
Downloads
37 (#444,147)
6 months
6 (#588,321)
Historical graph of downloads
Citations of this work
Lattice nonembeddings and initial segments of the recursively enumerable degrees.Rod Downey - 1990 - Annals of Pure and Applied Logic 49 (2):97-119.
Structural interactions of the recursively enumerable T- and W-degrees.R. G. Downey & M. Stob - 1986 - Annals of Pure and Applied Logic 31:205-236.
Undecidability and 1-types in the recursively enumerable degrees.Klaus Ambos-Spies & Richard A. Shore - 1993 - Annals of Pure and Applied Logic 63 (1):3-37.
Degree theoretical splitting properties of recursively enumerable sets.Klaus Ambos-Spies & Peter A. Fejer - 1988 - Journal of Symbolic Logic 53 (4):1110-1137.
Splitting properties of R. E. sets and degrees.R. G. Downey & L. V. Welch - 1986 - Journal of Symbolic Logic 51 (1):88-109.
References found in this work
The infinite injury priority method.Robert I. Soare - 1976 - Journal of Symbolic Logic 41 (2):513-530.
The Upper Semi-Lattice of Degrees of Recursive Unsolvability.S. C. Kleene & Emil L. Post - 1956 - Journal of Symbolic Logic 21 (4):407-408.
Recursively Enumerable Sets of Positive Integers and Their Decision Problems.Emil L. Post - 1945 - Journal of Symbolic Logic 10 (1):18-19.
A recursively enumerable degree which will not split over all lesser ones.Alistair H. Lachlan - 1976 - Annals of Mathematical Logic 9 (4):307.
Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability.R. M. Friedberg - 1958 - Journal of Symbolic Logic 23 (2):225-226.
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-84dbcd7b48-z59k4 uwo