The priority method for the construction of recursively enumerable sets
- 1 January 1973
- book chapter
- Published by Springer Nature
- p. 299-310
- https://doi.org/10.1007/bfb0066779
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The Priority Method IMathematical Logic Quarterly, 1967
- A minimal pair of 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
- On the Degrees Less than 0 Annals of Mathematics, 1963
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)Proceedings of the National Academy of Sciences, 1957