The decision problem for recursively enumerable degrees

DOI10.1090/S0002-9904-1975-13876-6MaRDI QIDQ4106188zbMATH OpenFDO

Authors Joseph R. Shoenfield

Publication date 1975

Published in Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/S0002-9904-1975-13876-6

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Decidability of theories and sets of sentences (03B25) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites work

• A minimal pair of recursively enumerable degrees
• Degrees of Unsolvability. (AM-55)
• Distributive Initial Segments of the Degrees of Unsolvability
• scientific article; zbMATH DE number 3304986 (Why is no real title available?)
• scientific article; zbMATH DE number 3404227 (Why is no real title available?)
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• On degrees of recursive unsolvability
• Sublattices of the Recursively Enumerable Degrees
• The impossibility of finding relative complements for recursively enumerable degrees
• The upper semi-lattice of degrees of recursive unsolvability
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)

Cited in

(2)

• Not every finite lattice is embeddable in the recursively enumerable degrees
• Recursively enumerable sets and degrees

This page was built for publication: The decision problem for recursively enumerable degrees

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