Recursively enumerable generic sets
From MaRDI portal
Publication:3962980
DOI10.2307/2273100zbMath0498.03026OpenAlexW1972481159MaRDI QIDQ3962980
Publication date: 1982
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273100
Post's problempromptly simple setautomorphism constructionsincomparable Turing degreelow recursively enumerable sets
Related Items
An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees, Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets, Duality, non-standard elements, and dynamic properties of r.e. sets, Diagonalizations over polynomial time computable sets, A remark on the length problem, NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS, The Quotient Semilattice of the Recursively Enumerable Degrees Modulo the Cappable Degrees, Cupping and noncapping in the r.e. weak truth table and turing degrees, Splitting properties and jump classes, The distribution of the generic recursively enumerable degrees, Permutations and Presentations, The Role of True Finiteness in the Admissible Recursively Enumerable Degrees, Generic objects in recursion theory. II: Operations on recursive approximation spaces, Definable properties of the computably enumerable sets, Dynamic notions of genericity and array noncomputability, Some orbits for \({\mathcal E}\), Splitting theorems in recursion theory, Presentations of computably enumerable reals.
Cites Work
