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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
