Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4662174 | Annals of Pure and Applied Logic | 2010 | 6 Pages |
Abstract
We prove that if S is an ω-model of weak weak König’s lemma and , is incomputable, then there exists , such that A and B are Turing incomparable. This extends a recent result of Kučera and Slaman who proved that if S0 is a Scott set (i.e. an ω-model of weak König’s lemma) and A∈S0, A⊆ω, is incomputable, then there exists B∈S0, B⊆ω, such that A and B are Turing incomparable.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic