Recursively enumerable generic sets
From MaRDI portal
Publication:3962980
DOI10.2307/2273100zbMATH Open0498.03026OpenAlexW1972481159MaRDI QIDQ3962980FDOQ3962980
Authors: Wolfgang Maass 
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
Cites Work
Cited In (18)
- The distribution of the generic recursively enumerable degrees
- Presentations of computably enumerable reals.
- Splitting properties and jump classes
- Splitting theorems in recursion theory
- A remark on the length problem
- The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
- Definable properties of the computably enumerable sets
- The Quotient Semilattice of the Recursively Enumerable Degrees Modulo the Cappable Degrees
- Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
- Cupping and noncapping in the r.e. weak truth table and turing degrees
- Duality, non-standard elements, and dynamic properties of r.e. sets
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
- Generic objects in recursion theory. II: Operations on recursive approximation spaces
- Diagonalizations over polynomial time computable sets
- Dynamic notions of genericity and array noncomputability
- Permutations and Presentations
- Some orbits for \({\mathcal E}\)
- Nonstandard models in recursion theory and reverse mathematics
This page was built for publication: Recursively enumerable generic sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3962980)
