STANDARD CLASSES OF RECURSIVELY ENUMERABLE SETS
From MaRDI portal
Publication:4766970
DOI10.1002/malq.19640100203zbMath0282.02016MaRDI 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
03D25: Recursively (computably) enumerable sets and degrees
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items
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, 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