Algebraic aspects of the computably enumerable degrees.

DOI10.1073/PNAS.92.2.617MaRDI QIDQ4326308zbMATH OpenOpenAlexWikidataFDO

Authors 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 theorydegrees of unsolvabilityextension of embedding problemnonextensionrecursively enumerable setsTuring computabilityTuring degrees

Mathematics Subject Classification ID

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

Recommendations

• Degree spectra and computable dimensions in algebraic structures
• scientific article; zbMATH DE number 1405572
• Minimal generalized computable enumerations and high degrees
• Enumerations in computable structure theory
• scientific article; zbMATH DE number 1531929
• COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS
• Extensions of Embeddings in the Computably Enumerable Degrees
• scientific article; zbMATH DE number 23020
• Bounding minimal degrees by computably enumerable degrees
• Complexity classes and completeness in algebraic geometry

Cited in

(15)

• A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees
• Turing reducibility as algebraic embeddability
• Turing computability: structural theory
• Extensions of embeddings below computably enumerable degrees
• ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS
• Degree Structures: Local and Global Investigations
• Extensions of Embeddings in the Computably Enumerable Degrees
• scientific article; zbMATH DE number 4085634 (Why is no real title available?)
• COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS
• scientific article; zbMATH DE number 5066582 (Why is no real title available?)
• A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element
• Extension of embeddings in the computably enumerable degrees
• Computably enumerable sets and related issues
• Model-theoretic properties of Turing degrees in the Ershov difference hierarchy
• On Lachlan's major sub-degree problem

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

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