On completely recursively enumerable classes and their key arrays

DOI10.2307/2269105MaRDI QIDQ3237143zbMATH OpenOpenAlexFDO

Authors Henry Gordon Rice

Publication date 1956

Published in Journal of Symbolic Logic (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• Some Theorems on Classes of Recursively Enumerable Sets
• scientific article; zbMATH DE number 3857079
• On a Class of Recursively Enumerable Sets
• scientific article; zbMATH DE number 3997771
• On recursive enumerability with finite repetitions

Cited in

(12)

• Certain properties of Post enumeration retracts
• Complexity classes of partial recursive functions
• A second step towards complexity-theoretic analogs of Rice's Theorem
• On learning of functions refutably.
• Some Theorems on Classes of Recursively Enumerable Sets
• Recursive equivalence types and combinatorial functions
• Recursively enumerable sets and degrees
• Generalization versus classification
• Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)
• Array nonrecursiveness and relative recursive enumerability
• A simple example of blocking the Craig trick
• Lower bounds and the hardness of counting properties

This page was built for publication: On completely recursively enumerable classes and their key arrays

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