Distributive Initial Segments of the Degrees of Unsolvability

DOI10.1002/malq.19680143002zbMath0176.27803OpenAlexW1970488443MaRDI QIDQ5566515

Alistair H. Lachlan

Publication date: 1968

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19680143002

zbMATH Keywords

recursion theory, constructive mathematics

Related Items

The structure of the honest polynomial m-degrees ⋮ Lattices of c-degrees ⋮ THE n-r.e. DEGREES: UNDECIDABILITY AND Σ₁ SUBSTRUCTURES ⋮ The ∀∃-theory of ℛ(≤,∨,∧) is undecidable ⋮ Initial segments of the degrees of constructibility ⋮ On initial segments of hyperdegrees ⋮ A faithful interpretation of the intuitionistic propositional calculus by means of an initial segment of the Medvedev lattice ⋮ Initial segments of the degrees of unsolvability Part II: minimal degrees ⋮ The arithmetic and Turing degrees are not elementarily equivalent ⋮ The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility ⋮ Not every finite lattice is embeddable in the recursively enumerable degrees ⋮ Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees ⋮ One hundred and two problems in mathematical logic ⋮ Natural factors of the Medvedev lattice capturing IPC ⋮ Noninitial segments of the α-degrees ⋮ The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory ⋮ The decision problem for recursively enumerable degrees ⋮ Embedding jump upper semilattices into the Turing degrees ⋮ An application of Σ₄⁰ determinacy to the degrees of unsolvability ⋮ Embedding and coding below a 1-generic degree ⋮ Lattice initial segments of the hyperdegrees ⋮ Fixed points of jump preserving automorphisms of degrees ⋮ Undecidability and initial segments of the (r.e.) tt-degrees ⋮ Turing computability: structural theory ⋮ Decidability and Invariant Classes for Degree Structures ⋮ Recursively enumerable sets and degrees ⋮ Definable degrees and automorphisms of 𝒟 ⋮ Initial segments of the degrees of size \(\aleph _ 1\) ⋮ Degree Structures: Local and Global Investigations ⋮ Independence Results on the Global Structure of the Turing Degrees ⋮ Decidability of the “almost all” theory of degrees

This page was built for publication: Distributive Initial Segments of the Degrees of Unsolvability