- 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
Some minimal pairs of alpha-recursively enumerable degrees
Annals of Mathematical Logic 4 (4):415 (1972)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Some More Minimal Pairs of α‐Recursively Enumerable Degrees.Richard A. Shore - 1978 - Mathematical Logic Quarterly 24 (25‐30):409-418.
On suborderings of the alpha-recursively enumerable alpha-degrees.Manuel Lerman - 1972 - Annals of Mathematical Logic 4 (4):369.
Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets.Manuel Lerman - 1991 - Mathematical Logic Quarterly 37 (19‐22):331-342.
The recursively enumerable alpha-degrees are dense.Richard A. Shore - 1976 - Annals of Mathematical Logic 9 (1/2):123.
On alpha- and beta-recursively enumerable degrees.Wolfgang Maass - 1979 - Annals of Mathematical Logic 16 (3):205.
Minimal pairs and high recursively enumerable degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
Highness and bounding minimal pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
The discontinuity of splitting in the recursively enumerable degrees.S. Barry Cooper & Xiaoding Yi - 1995 - Archive for Mathematical Logic 34 (4):247-256.
Strong Minimal Covers for Recursively Enumerable Degrees.S. Barry Cooper - 1996 - Mathematical Logic Quarterly 42 (1):191-196.
Strong Minimal Covers for Recursively Enumerable Degrees.S. Cooper - 1996 - Mathematical Logic Quarterly 42 (1):191-196.
Analytics
Added to PP
2014-01-17
Downloads
24 (#966,050)
6 months
10 (#312,841)
2014-01-17
Downloads
24 (#966,050)
6 months
10 (#312,841)
Historical graph of downloads
Citations of this work
One hundred and two problems in mathematical logic.Harvey Friedman - 1975 - Journal of Symbolic Logic 40 (2):113-129.
The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
Inadmissibility, tame R.E. sets and the admissible collapse.Wolfgang Maass - 1978 - Annals of Mathematical Logic 13 (2):149-170.
Fragments of Kripke–Platek set theory and the metamathematics of $$\alpha $$ α -recursion theory.Sy-David Friedman, Wei Li & Tin Lok Wong - 2016 - Archive for Mathematical Logic 55 (7-8):899-924.
An extension of the nondiamond theorem in classical and α-recursion theory.Klaus Ambos-Spies - 1984 - Journal of Symbolic Logic 49 (2):586-607.
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.
The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
Metarecursively enumerable sets and their metadegrees.Graham C. Driscoll - 1968 - Journal of Symbolic Logic 33 (3):389-411.
On suborderings of the alpha-recursively enumerable alpha-degrees.Manuel Lerman - 1972 - Annals of Mathematical Logic 4 (4):369.
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. Jockusch - 1972 - Journal of Symbolic Logic 37 (3):611-611.
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-8567d8d854-f747c dc2