The decision problem for recursively enumerable degrees

DOI10.1090/S0002-9904-1975-13876-6zbMath0339.02043MaRDI QIDQ4106188

J. R. Shoenfield

Publication date: 1975

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

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)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• On degrees of recursive unsolvability
• The upper semi-lattice of degrees of recursive unsolvability
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Degrees of Unsolvability. (AM-55)
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• The impossibility of finding relative complements for recursively enumerable degrees
• Distributive Initial Segments of the Degrees of Unsolvability
• Sublattices of the Recursively Enumerable Degrees