Three theorems on the degrees of recursively enumerable sets
From MaRDI portal
Publication:2395863
DOI10.1215/S0012-7094-65-03247-3zbMath0134.00805OpenAlexW2062249564MaRDI QIDQ2395863
Publication date: 1965
Published in: Duke Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1215/s0012-7094-65-03247-3
Related Items
Uniformly introreducible sets, Bases of supermaximal subspaces and Steinitz systems. I, On the Turing degrees of minimal index sets, On the learnability of vector spaces, Simplicity of recursively enumerable sets, Minimal pairs in initial segments of the recursively enumerable degrees, Metarecursively enumerable sets and their metadegrees, Deficiency Sets and Bounded Information Reducibilities, Two Theorems on Hyperhypersimple Sets, Boolean algebras and orbits of the lattice of r.e sets modulo the finite sets, Initial segments of the degrees of unsolvability Part II: minimal degrees, Recursively enumerable sets which are uniform for finite extensions, Computable elements and functions in effectively enumerable topological spaces, Recursive Density Types. II, On the Degrees of Index Sets. II, Honest polynomial time reducibilities and the \(P=?NP\) problem, Relationships Between Reducibilities, Semirecursive Sets and Positive Reducibility, Some reducibilities and splittings of recursively enumerable sets, Two existence theorems for computable numerations, Über die Reduzierbarkeit berechenbarer Numerierungen, Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets, Maximal and Cohesive vector spaces, Upper semilattice of recursively enumerable sQ-degrees, α-Degrees of maximal α-r.e. sets, Recursively enumerable sets and degrees, Computational complexity, speedable and levelable sets, A Completely Mitotic Nonrecursive R.E. Degree, Uniform almost everywhere domination, On the subalgebras of R. Robinson's algebras, Recursion theory on orderings. I. A model theoretic setting, On r.e. and co-r.e. vector spaces with nonextendible bases, Sets without subsets of higher many-one degree, Automorphisms of the lattice of recursively enumerable sets, Degrees of sets having no subsets of higher m- and t t-degree, Strong reducibilities, Cappable recursively enumerable degrees and Post's program, Splitting theorems in recursion theory, Mitotic recursively enumerable sets
