On a problem of Cooper and Epstein

DOI10.2178/JSL/1045861506MaRDI QIDQ4457726zbMATH OpenOpenAlexFDO

Authors Sh. T. Ishmukhametov

Publication date 25 March 2004

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/jsl/1045861506

zbMATH Keywords

minimal degreec.e. degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• On a theorem of Cooper
• On a Theorem of Cooper
• scientific article; zbMATH DE number 148783
• scientific article; zbMATH DE number 3911411
• Proof of a conjecture of Cooper
• On a problem of Eisenstein
• On Eisenstein's problem
• Notes on a problem of H. Cohn
• On a question concerning the Cohen's theorem
• On the Coates-Sinnott Conjecture

Cites work

• Complementing below recursively enumerable degrees
• Initial segments of degrees below 0′
• Initial segments of the degrees of unsolvability Part II: minimal degrees
• Minimal degrees of unsolvability and the full approximation construction
• Minimal pairs in initial segments of the recursively enumerable degrees
• On degrees of recursive unsolvability
• The strong anticupping property for recursively enumerable degrees

Cited in

(2)

• A hyperimmune minimal degree and an ANR 2-minimal degree
• Computably enumerable Turing degrees and the meet property

This page was built for publication: On a problem of Cooper and Epstein

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