Algebraic aspects of the computably enumerable degrees.

DOI10.1073/pnas.92.2.617zbMath0812.03021OpenAlexW2060846300WikidataQ34786275 ScholiaQ34786275MaRDI QIDQ4326308

Theodore A. Slaman, Robert I. Soare

Publication date: 16 May 1995

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC42793

zbMATH Keywords

computability theoryTuring computabilityrecursively enumerable setsTuring degreesdegrees of unsolvabilityextension of embedding problemnonextension

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (6)

On Lachlan's major sub-degree problem ⋮ A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element ⋮ Turing computability: structural theory ⋮ Model-theoretic properties of Turing degrees in the Ershov difference hierarchy ⋮ Degree Structures: Local and Global Investigations ⋮ A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees

This page was built for publication: Algebraic aspects of the computably enumerable degrees.