High recursively enumerable degrees and the anti-cupping property
- 1 January 1981
- book chapter
- Published by Springer Nature
- p. 230-245
- https://doi.org/10.1007/bfb0090950
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- The infinite injury priority methodThe Journal of Symbolic Logic, 1976
- The weak truth table degrees of recursively enumerable setsAnnals of Mathematical Logic, 1975
- Minimal pairs and high recursively enumerable degreesThe Journal of Symbolic Logic, 1974
- Admissible ordinals and priority argumentsPublished by Springer Nature ,1973
- A Dichotomy of the Recursively Enumerable SetsMathematical Logic Quarterly, 1968
- The impossibility of finding relative complements for recursively enumerable degreesThe Journal of Symbolic Logic, 1966
- Lower Bounds for Pairs of Recursively Enumerable DegreesProceedings of the London Mathematical Society, 1966
- The Recursively Enumerable Degrees are DenseAnnals of Mathematics, 1964
- Recursive enumerability and the jump operatorTransactions of the American Mathematical Society, 1963
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)Proceedings of the National Academy of Sciences, 1957