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