On the indexing of classes of recursively enumerable sets

DOI10.2307/2270617zbMath0143.01203OpenAlexW2028774010MaRDI QIDQ5518359

Alistair H. Lachlan

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

zbMATH Keywords

mathematical logic

Related Items (8)

On cardinality of semilattices of enumerations of nondiscrete families ⋮ On computable enumerations. I ⋮ 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 ⋮ Sequences Having an Effective Fixed-Point Property ⋮ Computable functionals of finite types

Cites Work

• Creative Functions
• STANDARD CLASSES OF RECURSIVELY ENUMERABLE SETS
• Creative sets

This page was built for publication: On the indexing of classes of recursively enumerable sets