Lachlan Non-Splitting Pairs and high computably enumerable Turing degrees
A given c.e. degree a > 0 has a non-trivial splitting into c.e. degrees v and w if a is the join of v and w and v | w. A Lachlan Non-Splitting Pair is a pair of c.e. degrees < a,d > such that a > d and there is no non-trivial splitting of a into c.e. degrees w and v with w > d and v &...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
University of Leeds
2018
|
| Subjects: | |
| Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.758317 |