The Structure of the Lattice of Recursive Sets

DOI10.1002/MALQ.19760220125zbMATH Open0328.02023OpenAlexW2122870618MaRDI QIDQ4093425FDOQ4093425

Authors: Bernhard G. Goetze 

Publication date: 1976

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19760220125

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cited In (3)

• How much partiality is needed for a theory of computability?
• C-quasi-minimal enumeration degrees below \(\mathbf c'\)
• A note on algebras of languages

This page was built for publication: The Structure of the Lattice of Recursive Sets

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