The undecidability of the recursively enumerable degrees
Authors:
Leo Harrington and Saharon Shelah
Journal:
Bull. Amer. Math. Soc. 6 (1982), 79-80
MSC (1970):
Primary 02F25, 02F30
DOI:
https://doi.org/10.1090/S0273-0979-1982-14970-9
MathSciNet review:
634436
Full-text PDF Free Access
References | Similar Articles | Additional Information
- 1. Alistair H. Lachlan, A recursively enumerable degree which will not split over all lesser ones, Ann. Math. Logic 9 (1976), no. 4, 307–365. MR 409150, https://doi.org/10.1016/0003-4843(76)90016-4
- 2. Hartley Rogers Jr., Theory of recursive functions and effective computability, McGraw-Hill Book Co., New York-Toronto, Ont.-London, 1967. MR 0224462
Retrieve articles in Bulletin of the American Mathematical Society with MSC (1970): 02F25, 02F30
Retrieve articles in all journals with MSC (1970): 02F25, 02F30
Additional Information
DOI:
https://doi.org/10.1090/S0273-0979-1982-14970-9
