Some Theorems on Classes of Recursively Enumerable Sets

DOI10.2307/1993131zbMath0083.00302OpenAlexW4239085824MaRDI QIDQ3255349

J. C. E. Dekker, John Myhill

Publication date: 1958

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

zbMATH Keywords

classes of recursively enumerable sets

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Related Items

The basic theory of partial \(\alpha\)-recursive operators ⋮ On the Degrees of Index Sets ⋮ Effective inseparability in a topological setting ⋮ On Creative Sets and Indices of Partial Recursive Functions ⋮ Isomorphism Types of Index Sets of Partial Recursive Functions ⋮ Recursively enumerable classes and their application to recursive sequences of formal theories ⋮ A Theorem on Productive Functions ⋮ A Theorem on Recursively Enumerable Classes and Splinters ⋮ The Family of all Recursively Enumerable Classes of Finite Sets ⋮ Bibliography of John Myhill ⋮ Complexity classes of partial recursive functions ⋮ Recursively enumerable sets and degrees ⋮ The enumerability and invariance of complexity classes ⋮ The divisibility of isols by powers of primes ⋮ Unnamed Item ⋮ Termination analysis for offline partial evaluation of a higher order functional language

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The divisibility of isols by powers of primes
• The constructivity of maximal dual ideals in certain Boolean algebras
• The upper semi-lattice of degrees of recursive unsolvability
• Effective operations on partial recursive functions
• Degrees of Computability
• On completely recursively enumerable classes and their key arrays
• On definable sets of positive integers
• Classes of Recursively Enumerable Sets and Their Decision Problems
• Two Notes on Recursively Enumerable Sets
• Recursively enumerable sets of positive integers and their decision problems
• Productive Sets
• Creative sets