Lower Bounds for Pairs of Recursively Enumerable Degrees

DOI10.1112/plms/s3-16.1.537zbMath0156.00907OpenAlexW2006726677WikidataQ56430699 ScholiaQ56430699MaRDI QIDQ5537365

Alistair H. Lachlan

Publication date: 1966

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/plms/s3-16.1.537

zbMATH Keywords

mathematical logic

Related Items

Elementary theories and structural properties of d-c.e. and n-c.e. degrees ⋮ Decomposition and infima in the computably enumerable degrees ⋮ Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table Degrees ⋮ Structural interactions of the recursively enumerable T- and W-degrees ⋮ On Pairs of Recursively Enumerable Degrees ⋮ An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees ⋮ Intervals and sublattices of the r.e. weak truth table degrees. I: Density ⋮ Classification of degree classes associated with r.e. subspaces ⋮ Complementing below recursively enumerable degrees ⋮ On injective enumerability of recursively enumerable classes of cofinite sets ⋮ The discontinuity of splitting in the recursively enumerable degrees ⋮ A non-inversion theorem for the jump operator ⋮ Minimal pairs in initial segments of the recursively enumerable degrees ⋮ A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees ⋮ Infima of d.r.e. degrees ⋮ Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree ⋮ Decomposition of Recursively Enumerable Degrees ⋮ An extended Lachlan splitting theorem ⋮ Intervals containing exactly one c.e. degree ⋮ The Quotient Semilattice of the Recursively Enumerable Degrees Modulo the Cappable Degrees ⋮ Cupping and noncapping in the r.e. weak truth table and turing degrees ⋮ Infima in the recursively enumerable weak truth table degrees ⋮ Almost universal cupping and diamond embeddings ⋮ Not every finite lattice is embeddable in the recursively enumerable degrees ⋮ Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees ⋮ A superhigh diamond in the c.e. tt-degrees ⋮ Some results about the R.E. degrees ⋮ Elementary differences between the degrees of unsolvability and degrees of compressibility ⋮ Splitting properties and jump classes ⋮ A Survey of Results on the d-c.e. and n-c.e. Degrees ⋮ There Are No Maximal d.c.e. wtt-degrees ⋮ Nondensity of Double Bubbles in the D.C.E. Degrees ⋮ Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy ⋮ Complementing cappable degrees in the difference hierarchy. ⋮ Branching Degrees above low Degrees ⋮ The d.r.e. degrees are not dense ⋮ Branching in the \({\Sigma^0_2}\)-enumeration degrees: a new perspective ⋮ On Lachlan's major sub-degree problem ⋮ On co-simple isols and their intersection types ⋮ The decision problem for recursively enumerable degrees ⋮ A hierarchy for the plus cupping Turing degrees ⋮ Infima in the d.r.e. degrees ⋮ Undecidability and 1-types in the recursively enumerable degrees ⋮ Incomparable prime ideals of recursively enumerable degrees ⋮ Infima of d.r.e. Degrees ⋮ Extending the Cooper minimal pair theorem ⋮ \(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture ⋮ A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element ⋮ Diamond embeddings into the enumeration degrees ⋮ Turing computability: structural theory ⋮ Lattice nonembeddings and intervals of the recursively enumerable degrees ⋮ Model-theoretic properties of Turing degrees in the Ershov difference hierarchy ⋮ Recursively enumerable sets and degrees ⋮ T-Degrees, Jump Classes, and Strong Reducibilities ⋮ Tracing and domination in the Turing degrees ⋮ The recursively enumerable degrees have infinitely many one-types ⋮ The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable ⋮ Branching in the enumeration degrees of the \(\Sigma_2^0\) sets ⋮ A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees ⋮ Computably enumerable sets and quasi-reducibility ⋮ On the existence of a strong minimal pair ⋮ The density of the nonbranching degrees ⋮ Undecidability and 1-types in intervals of the computably enumerable degrees ⋮ Minimal pairs for P ⋮ Cappable recursively enumerable degrees and Post's program ⋮ The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical ⋮ Splitting theorems in recursion theory

This page was built for publication: Lower Bounds for Pairs of Recursively Enumerable Degrees