Filters on Computable Posets

Notre Dame Journal of Formal Logic 47 (4):479-485 (2006)
Abstract
We explore the problem of constructing maximal and unbounded filters on computable posets. We obtain both computability results and reverse mathematics results. A maximal filter is one that does not extend to a larger filter. We show that every computable poset has a \Delta^0_2 maximal filter, and there is a computable poset with no \Pi^0_1 or \Sigma^0_1 maximal filter. There is a computable poset on which every maximal filter is Turing complete. We obtain the reverse mathematics result that the principle "every countable poset has a maximal filter" is equivalent to ACA₀ over RCA₀. An unbounded filter is a filter which achieves each of its lower bounds in the poset. We show that every computable poset has a \Sigma^0_1 unbounded filter, and there is a computable poset with no \Pi^0_1 unbounded filter. We show that there is a computable poset on which every unbounded filter is Turing complete, and the principle "every countable poset has an unbounded filter" is equivalent to ACA₀ over RCA₀. We obtain additional reverse mathematics results related to extending arbitrary filters to unbounded filters and forming the upward closures of subsets of computable posets
Keywords computable poset   filter   reverse mathematics
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 9,357
External links
  •   Try with proxy.
  •   Try with proxy.
  •   Try with proxy.
  •   Try with proxy.
  •   Try with proxy.
  • Through your library Configure
    References found in this work BETA

    No references found.

    Citations of this work BETA

    No citations found.

    Similar books and articles
    Ramon Jansana (2003). Leibniz Filters Revisited. Studia Logica 75 (3):305 - 317.
    Andreas Blass (1990). Infinitary Combinatorics and Modal Logic. Journal of Symbolic Logic 55 (2):761-778.
    Otmar Spinas (1999). Countable Filters on Ω. Journal of Symbolic Logic 64 (2):469-478.
    Jeremy Avigad (2012). Uncomputably Noisy Ergodic Limits. Notre Dame Journal of Formal Logic 53 (3):347-350.
    Michael Moses (2010). The Block Relation in Computable Linear Orders. Notre Dame Journal of Formal Logic 52 (3):289-305.
    Janusz Pawlikowski (2001). Cohen Reals From Small Forcings. Journal of Symbolic Logic 66 (1):318-324.
    Analytics

    Monthly downloads

    Sorry, there are not enough data points to plot this chart.

    Added to index

    2010-08-24

    Total downloads

    0

    Recent downloads (6 months)

    0

    How can I increase my downloads?

    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.