No CrossRef data available.
Article contents
Principal filters definable by parameters in 𝓔bT†
Published online by Cambridge University Press: 01 February 2009
Abstract
We show that there exist c.e. bounded Turing degrees a, b such that 0 < a < 0′, and that for any c.e. bounded Turing degree x, we have b ∨ x = 0′ if and only if x ≥ a. The result gives an unexpected definability theorem in the structure of bounded Turing reducibility.
- Type
- Paper
- Information
- Mathematical Structures in Computer Science , Volume 19 , Special Issue 1: Theory and Applications of Models of Computation (TAMC) , February 2009 , pp. 153 - 167
- Copyright
- Copyright © Cambridge University Press 2009