Recursively enumerable generic sets
From MaRDI portal
Cites work
Cited in
(18)- Diagonalizations over polynomial time computable sets
- A remark on the length problem
- Splitting properties and jump classes
- Definable properties of the computably enumerable sets
- Dynamic notions of genericity and array noncomputability
- Splitting theorems in recursion theory
- Presentations of computably enumerable reals.
- Generic objects in recursion theory. II: Operations on recursive approximation spaces
- Some orbits for \({\mathcal E}\)
- Duality, non-standard elements, and dynamic properties of r.e. sets
- Nonstandard models in recursion theory and reverse mathematics
- 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
- The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
- Cupping and noncapping in the r.e. weak truth table and turing degrees
- Permutations and Presentations
- The Quotient Semilattice of the Recursively Enumerable Degrees Modulo the Cappable Degrees
- The distribution of the generic recursively enumerable degrees
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)