Distributive Initial Segments of the Degrees of Unsolvability

DOI10.1002/MALQ.19680143002MaRDI QIDQ5566515zbMATH OpenOpenAlexFDO

Authors 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

Cited in

(31)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5566515)