Complete Recursively Enumerable Sets

DOI10.2307/2036145MaRDI QIDQ5536627zbMATH OpenOpenAlexFDO

Authors Alistair H. Lachlan

Publication date 1968

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

zbMATH Keywords

mathematical logic

Cites work

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

Cited in

(3)

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

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)