STANDARD CLASSES OF RECURSIVELY ENUMERABLE SETS

DOI10.1002/MALQ.19640100203MaRDI QIDQ4766970zbMATH OpenOpenAlexFDO

Authors Alistair H. Lachlan

Publication date 1964

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

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

Mathematics Subject Classification ID

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

Cited in

(13)

• Computable numerations of morphisms
• Certain properties of Post enumeration retracts
• Enumerations of canonically calculable families of finite sets
• On computable enumerations. I
• On nonprincipal enumerations
• Sequences Having an Effective Fixed-Point Property
• On the existence of universal numberings for finite families of d.c.e. sets
• On the indexing of classes of recursively enumerable sets
• Effective Inseparability for Sequences of Sets
• Creative and Weakly Creative Sequences of r.e. Sets
• scientific article; zbMATH DE number 7763258 (Why is no real title available?)
• How much partiality is needed for a theory of computability?
• Relative completeness of arithmetical numberings

This page was built for publication: STANDARD CLASSES OF RECURSIVELY ENUMERABLE SETS

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