Countable initial segments of the degrees of unsolvability

DOI10.2307/2272227zbMath0361.02054OpenAlexW4241274824MaRDI QIDQ4133961

Robert Lebeuf, Alistair H. Lachlan

Publication date: 1976

Published in: The 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)

Related Items

Lattices of c-degrees, Initial segments of the degrees of constructibility, The jump is definable in the structure of the degrees of unsolvability, Not every finite lattice is embeddable in the recursively enumerable degrees, Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms, Intuitionistic logic and Muchnik degrees, A Rigid Cone in the Truth-Table Degrees with Jump, On some filters and ideals of the Medvedev lattice, The finite intervals of the Muchnik lattice, The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory, Constructive logic and the Medvedev lattice, Fixed points of jump preserving automorphisms of degrees, Local Initial Segments of The Turing Degrees, On automorphisms of the degrees that preserve jumps, Initial segments of the degrees of size \(\aleph _ 1\), Extensions of embeddings below computably enumerable degrees, The Turing closure of an Archimedean field, Strong reducibilities, Independence Results on the Global Structure of the Turing Degrees