On definable filters in computably enumerable degrees

Wei Wang,Decheng Ding

doi:10.1016/j.apal.2007.03.003

On definable filters in computably enumerable degrees

Wei Wang, Decheng Ding

https://doi.org/10.1016/j.apal.2007.03.003

Copy DOI

Journal: Annals of Pure and Applied Logic	Publication Date: Mar 19, 2007
Citations: 9	License type: elsevier-specific: oa user license

Affiliation: Nanjing University

#Computably Enumerable Degrees #Definable Subsets + Show 1 more

Abstract
Full-Text PDF
Similar Papers

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.

Full Text