- 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
Sublattices of the Recursively Enumerable Degrees
Mathematical Logic Quarterly 17 (1):273-280 (1971)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Sublattices of the Recursively Enumerable Degrees.S. K. Thomason - 1971 - Mathematical Logic Quarterly 17 (1):273-280.
Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets.Manuel Lerman - 1991 - Mathematical Logic Quarterly 37 (19‐22):331-342.
Classes of Recursively Enumerable Sets and Degrees of Unsolvability.Donald A. Martin - 1966 - Mathematical Logic Quarterly 12 (1):295-310.
Some More Minimal Pairs of α‐Recursively Enumerable Degrees.Richard A. Shore - 1978 - Mathematical Logic Quarterly 24 (25‐30):409-418.
Strong Minimal Covers for Recursively Enumerable Degrees.S. Cooper - 1996 - Mathematical Logic Quarterly 42 (1):191-196.
The Isolated D. R. E. Degrees are Dense in the R. E. Degrees.Geoffrey Laforte - 1996 - Mathematical Logic Quarterly 42 (1):83-103.
Strong Minimal Covers for Recursively Enumerable Degrees.S. Barry Cooper - 1996 - Mathematical Logic Quarterly 42 (1):191-196.
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees.Klaus Ambos-Spies & Ding Decheng - 1994 - Mathematical Logic Quarterly 40 (3):287-317.
Minimal weak truth table degrees and computably enumerable Turing degrees.R. G. Downey - 2020 - Providence, RI: American Mathematical Society. Edited by Keng Meng Ng & Reed Solomon.
Cooper S. B.. Degrees of unsolvability complementary between recursively enumerable degrees, Part I. Annals of mathematical logic, vol. 4 no. 1 , pp. 31–73. [REVIEW]Dick Epstein - 1975 - Journal of Symbolic Logic 40 (1):86-86.
Analytics
Added to PP
2013-11-24
Downloads
27 (#609,326)
6 months
9 (#355,272)
2013-11-24
Downloads
27 (#609,326)
6 months
9 (#355,272)
Historical graph of downloads
Citations of this work
On minimal pairs of enumeration degrees.Kevin McEvoy & S. Barry Cooper - 1985 - Journal of Symbolic Logic 50 (4):983-1001.
A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees.Steffen Lempp & Manuel Lerman - 1997 - Annals of Pure and Applied Logic 87 (2):167-185.
Lattice embeddings into the recursively enumerable degrees.K. Ambos-Spies & M. Lerman - 1986 - Journal of Symbolic Logic 51 (2):257-272.
On extensions of embeddings into the enumeration degrees of the -sets.Steffen Lempp, Theodore A. Slaman & Andrea Sorbi - 2005 - Journal of Mathematical Logic 5 (02):247-298.
Lattice embeddings into the recursively enumerable degrees. II.K. Ambos-Spies & M. Lerman - 1989 - Journal of Symbolic Logic 54 (3):735-760.
References found in this work
A minimal pair of recursively enumerable degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
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-68866f4b87-x7cz5 uwo