The Family of all Recursively Enumerable Classes of Finite Sets
From MaRDI portal
Publication:5625133
DOI10.2307/1995467zbMath0221.02022MaRDI QIDQ5625133
Publication date: 1971
Full work available at URL: https://doi.org/10.2307/1995467
03D25: Recursively (computably) enumerable sets and degrees
03D55: Hierarchies of computability and definability
Related Items
Rogers semilattices of limitwise monotonic numberings, On two types of concept lattices in the theory of numberings, Discrete families of recursive functions and index sets, Unnamed Item
Cites Work