On the indexing of classes of recursively enumerable sets
From MaRDI portal
Publication:5518359
DOI10.2307/2270617zbMath0143.01203MaRDI QIDQ5518359
Publication date: 1966
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2270617
Related Items
Computable numerations of morphisms, Enumerations of families of general recursive functions, Enumerations of canonically calculable families of finite sets, Some remarks about classes of recursively enumerable sets, On cardinality of semilattices of enumerations of nondiscrete families, Computable functionals of finite types, On computable enumerations. I, Sequences Having an Effective Fixed-Point Property
Cites Work