STANDARD CLASSES OF RECURSIVELY ENUMERABLE SETS
From MaRDI portal
Publication:4766970
DOI10.1002/malq.19640100203zbMath0282.02016OpenAlexW2086326215MaRDI QIDQ4766970
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
Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
How much partiality is needed for a theory of computability? ⋮ Unnamed Item ⋮ Effective Inseparability for Sequences of Sets ⋮ Creative and Weakly Creative Sequences of r.e. Sets ⋮ On the existence of universal numberings for finite families of d.c.e. sets ⋮ On computable enumerations. I ⋮ Computable numerations of morphisms ⋮ Certain properties of Post enumeration retracts ⋮ Enumerations of canonically calculable families of finite sets ⋮ On nonprincipal enumerations ⋮ Sequences Having an Effective Fixed-Point Property ⋮ On the indexing of classes of recursively enumerable sets
This page was built for publication: STANDARD CLASSES OF RECURSIVELY ENUMERABLE SETS