scientific article; zbMATH DE number 3404227
From MaRDI portal
zbMath0256.02021MaRDI QIDQ5670617
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Nonlowness is independent from fickleness, Structural interactions of the recursively enumerable T- and W-degrees, Intervals and sublattices of the r.e. weak truth table degrees. I: Density, Classification of degree classes associated with r.e. subspaces, Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree, Not every finite lattice is embeddable in the recursively enumerable degrees, Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees, Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees, On strongly jump traceable reals, A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES, On Lachlan's major sub-degree problem, The decision problem for recursively enumerable degrees, Incomparable prime ideals of recursively enumerable degrees, A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element, Embeddings of \(N_5\) and the contiguous degrees, Lattice nonembeddings and intervals of the recursively enumerable degrees, Hierarchy of Computably Enumerable Degrees II, Lattice nonembeddings and initial segments of the recursively enumerable degrees, The recursively enumerable degrees have infinitely many one-types, Branching in the enumeration degrees of the \(\Sigma_2^0\) sets, Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees, Computably enumerable sets and quasi-reducibility, The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
