The Family of all Recursively Enumerable Classes of Finite Sets

DOI10.2307/1995467MaRDI QIDQ5625133zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3273186 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• On Properties of Regressive Sets
• Recursively enumerable classes and their application to recursive sequences of formal theories
• Recursively Enumerable Sets and Retracing Functions
• Some Theorems on Classes of Recursively Enumerable Sets

Cited in

(4)

• Discrete families of recursive functions and index sets
• scientific article; zbMATH DE number 3478858 (Why is no real title available?)
• Rogers semilattices of limitwise monotonic numberings
• On two types of concept lattices in the theory of numberings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5625133)