The Family of all Recursively Enumerable Classes of Finite Sets

DOI10.2307/1995467zbMath0221.02022OpenAlexW4238798531MaRDI QIDQ5625133

Thomas G. McLaughlin

Publication date: 1971

Full work available at URL: https://doi.org/10.2307/1995467

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Hierarchies of computability and definability (03D55)

Related Items (4)

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

• Some Theorems on Classes of Recursively Enumerable Sets
• Recursively Enumerable Sets and Retracing Functions
• On Properties of Regressive Sets
• Recursively enumerable classes and their application to recursive sequences of formal theories
• Unnamed Item
• Unnamed Item

This page was built for publication: The Family of all Recursively Enumerable Classes of Finite Sets