Minimal degrees of unsolvability and the full approximation construction

From MaRDI portal

Revision as of 05:23, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4074893

Jump to:navigation, search

DOI10.1090/memo/0162zbMath0315.02043OpenAlexW2145265838MaRDI QIDQ4074893

Richard L. Epstein

Publication date: 1975

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

Full work available at URL: https://doi.org/10.1090/memo/0162

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (6)

Bounding minimal degrees by computably enumerable degrees ⋮ Complementing below recursively enumerable degrees ⋮ A superhigh diamond in the c.e. tt-degrees ⋮ Degrees bounding minimal degrees ⋮ A single minimal complement for the c.e. degrees ⋮ On a problem of Cooper and Epstein

This page was built for publication: Minimal degrees of unsolvability and the full approximation construction

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4074893&oldid=17822084"