Title of article
On definable filters in computably enumerable degrees
Author/Authors
Wang، نويسنده , , Wei and Ding، نويسنده , , Decheng، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
13
From page
71
To page
83
Abstract
Based on a result of Nies on definability of the upper semilattice of computably enumerable degrees (denoted by R ), we find that in R filters generated by definable subsets are also definable. As applications we demonstrate two new definable filters and study their supremum. Finally we demonstrate a counterexample.
Keywords
Computably enumerable degrees , Definable filters
Journal title
Annals of Pure and Applied Logic
Serial Year
2007
Journal title
Annals of Pure and Applied Logic
Record number
1443875
Link To Document