Three theorems on the degrees of recursively enumerable sets
From MaRDI portal
Publication:2395863
Cited in
(39)- On r.e. and co-r.e. vector spaces with nonextendible bases
- A Completely Mitotic Nonrecursive R.E. Degree
- Honest polynomial time reducibilities and the \(P=?NP\) problem
- Degrees of sets having no subsets of higher m- and t t-degree
- Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
- Recursion theory on orderings. I. A model theoretic setting
- Automorphisms of the lattice of recursively enumerable sets
- Uniform almost everywhere domination
- Two existence theorems for computable numerations
- Relationships Between Reducibilities
- On the Turing degrees of minimal index sets
- Computational complexity, speedable and levelable sets
- On the subalgebras of R. Robinson's algebras
- On the learnability of vector spaces
- Über die Reduzierbarkeit berechenbarer Numerierungen
- Recursively enumerable sets and degrees
- Sets without subsets of higher many-one degree
- Deficiency Sets and Bounded Information Reducibilities
- Two Theorems on Hyperhypersimple Sets
- Mitotic recursively enumerable sets
- Some reducibilities and splittings of recursively enumerable sets
- Initial segments of the degrees of unsolvability Part II: minimal degrees
- Minimal pairs in initial segments of the recursively enumerable degrees
- Cappable recursively enumerable degrees and Post's program
- Simplicity of recursively enumerable sets
- Splitting theorems in recursion theory
- Semirecursive Sets and Positive Reducibility
- Recursive Density Types. II
- Upper semilattice of recursively enumerable sQ-degrees
- α-Degrees of maximal α-r.e. sets
- Boolean algebras and orbits of the lattice of r.e sets modulo the finite sets
- Bases of supermaximal subspaces and Steinitz systems. I
- Metarecursively enumerable sets and their metadegrees
- Recursively enumerable sets which are uniform for finite extensions
- Uniformly introreducible sets
- Strong reducibilities
- On the Degrees of Index Sets. II
- Maximal and Cohesive vector spaces
- Computable elements and functions in effectively enumerable topological spaces
This page was built for publication: Three theorems on the degrees of recursively enumerable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2395863)
