Complete Recursively Enumerable Sets

DOI10.2307/2036145zbMATH Open0155.34001OpenAlexW4244426146MaRDI QIDQ5536627FDOQ5536627

Alistair H. Lachlan

Publication date: 1968

Full work available at URL: https://doi.org/10.2307/2036145

zbMATH Keywords

mathematical logic

Cites Work

• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Creative sets
• Completeness, the Recursion Theorem, and Effectively Simple Sets
• Effectively Simple Sets

Cited In (3)

• Effectively hyperimmune sets and majorants
• Recursively enumerable sets and degrees
• On effectively hypersimple sets

This page was built for publication: Complete Recursively Enumerable Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5536627)