TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES

Rod Downey, Noam Greenberg, Rebecca Weber

Journal of Mathematical Logic · 2007 · 29 citations · 13 references

Concepts

Abstract

We characterize the class of c.e. degrees that bound a critical triple (equivalently, a weak critical triple) as those degrees that compute a function that has no ω-c.e. approximation.

References

13