The equivalence of determinacy and iterated sharps

Journal of Symbolic Logic 55 (2):502-525 (1990)
Abstract
We characterize, in terms of determinacy, the existence of 0 ♯♯ as well as the existence of each of the following: 0 ♯♯♯ , 0 ♯♯♯♯ ,0 ♯♯♯♯♯ , .... For k ∈ ω, we define two classes of sets, (k * Σ 0 1 ) * and (k * Σ 0 1 ) * + , which lie strictly between $\bigcup_{\beta and Δ(ω 2 -Π 1 1 ). We also define 0 1♯ as 0 ♯ and in general, 0 (k + 1)♯ as (0 k♯) ♯ . We then show that the existence of 0 (k + 1)♯ is equivalent to the determinacy of ((k + 1) * Σ 0 1 ) * as well as the determinacy of (k * Σ 0 1 ) * +
Keywords No keywords specified (fix it)
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,360
External links
  •   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
    Analytics

    Monthly downloads

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

    Added to index

    2009-01-28

    Total downloads

    1 ( #306,410 of 1,089,062 )

    Recent downloads (6 months)

    1 ( #69,801 of 1,089,062 )

    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.