Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
|
   
Available in electronic format
Available in print format 		Bulletin of the American Mathematical Society
Bulletin of the American Mathematical Society
ISSN 1088-9485(e) ISSN 0273-0979(p)

     

The undecidability of the recursively enumerable degrees

Author(s): Leo Harrington; Saharon Shelah
Journal: Bull. Amer. Math. Soc. 6 (1982), 79-80.
MSC (1970): Primary 02F25, 02F30
MathSciNet review: 634436
Retrieve article in: PDF

References | Similar articles | Additional information

References:

1.
A. H. Lachlan, A recursively enumerable degree which will not split over all lesser ones, Ann. Math. Logic 9 (1975), 307-365. MR 409150
2.
H. Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967. MR 224462

Similar Articles:

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: 10.1090/S0273-0979-1982-14970-9
PII: S 0273-0979(1982)14970-9




AMS and Social Media LinkedIn Facebook Podcasts Twitter YouTube RSS Feeds Blogs Wikipedia