Initial segments of one-one degrees

DOI10.2140/PJM.1969.29.351MaRDI QIDQ2535239zbMATH OpenOpenAlexFDO

Authors Alistair H. Lachlan

Publication date 1969

Published in Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/pjm.1969.29.351

zbMATH Keywords

recursion theory, constructive mathematics

Cited in

(11)

• Undecidability and initial segments of the (r.e.) tt-degrees
• 1-reducibility inside an m-degree with a maximal set
• Minimal weak truth table degrees and computably enumerable Turing degrees
• Initial segments of the degrees of ceers
• Strong reducibilities
• The index sets of m-degrees
• Universal computably enumerable equivalence relations
• Embeddings in the Strong Reducibilities Between 1 and npm
• On the degree structure of equivalence relations under computable reducibility
• Hyper-hypersimple \(m\)-degrees
• The structure of computably enumerable preorder relations

This page was built for publication: Initial segments of one-one degrees

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