Countable initial segments of the degrees of unsolvability

DOI10.2307/2272227MaRDI QIDQ4133961zbMATH OpenOpenAlexFDO

Authors Robert Lebeuf, Alistair H. Lachlan

Publication date 1976

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL http://summit.sfu.ca/item/3073

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Cited in

(19)

• Lattices of c-degrees
• Initial segments of the degrees of constructibility
• 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
• On automorphisms of the degrees that preserve jumps
• The Turing closure of an Archimedean field
• Initial segments of the degrees of size \(\aleph _ 1\)
• Constructive logic and the Medvedev lattice
• Extensions of embeddings below computably enumerable degrees
• A Rigid Cone in the Truth-Table Degrees with Jump
• Independence Results on the Global Structure of the Turing Degrees
• The jump is definable in the structure of the degrees of unsolvability
• Strong reducibilities
• Intuitionistic logic and Muchnik degrees
• Local Initial Segments of The Turing Degrees
• The finite intervals of the Muchnik lattice
• Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms
• On some filters and ideals of the Medvedev lattice

This page was built for publication: Countable 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 Q4133961)