Skip to main content
Log in

On the filter of computably enumerable supersets of an r-maximal set

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract.

We study the filter ℒ*(A) of computably enumerable supersets (modulo finite sets) of an r-maximal set A and show that, for some such set A, the property of being cofinite in ℒ*(A) is still Σ0 3-complete. This implies that for this A, there is no uniformly computably enumerable “tower” of sets exhausting exactly the coinfinite sets in ℒ*(A).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 6 November 1999 / Revised version: 10 March 2000 /¶Published online: 18 May 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lempp, S., Nies, A. & Solomon, D. On the filter of computably enumerable supersets of an r-maximal set. Arch. Math. Logic 40, 415–423 (2001). https://doi.org/10.1007/PL00003846

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00003846

Navigation