Switch to: Citations

Add references

You must login to add references.
  1. Factorization of polynomials and °1 induction.S. G. Simpson - 1986 - Annals of Pure and Applied Logic 31:289.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • Infinite games in the Cantor space and subsystems of second order arithmetic.Takako Nemoto, MedYahya Ould MedSalem & Kazuyuki Tanaka - 2007 - Mathematical Logic Quarterly 53 (3):226-236.
    In this paper we study the determinacy strength of infinite games in the Cantor space and compare them with their counterparts in the Baire space. We show the following theorems:1. RCA0 ⊢ equation image-Det* ↔ equation image-Det* ↔ WKL0.2. RCA0 ⊢ 2-Det* ↔ ACA0.3. RCA0 ⊢ equation image-Det* ↔ equation image-Det* ↔ equation image-Det ↔ equation image-Det ↔ ATR0.4. For 1 < k < ω, RCA0 ⊢ k-Det* ↔ k –1-Det.5. RCA0 ⊢ equation image-Det* ↔ equation image-Det.Here, Det* stands for (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Weak axioms of determinacy and subsystems of analysis I: δmath image games.Kazuyuki Tanaka - 1990 - Mathematical Logic Quarterly 36 (6):481-491.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Weak axioms of determinacy and subsystems of analysis I: δ20 games.Kazuyuki Tanaka - 1990 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (6):481-491.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Weak axioms of determinacy and subsystems of analysis II.Kazuyuki Tanaka - 1991 - Annals of Pure and Applied Logic 52 (1-2):181-193.
    In [10], we have shown that the statement that all ∑ 1 1 partitions are Ramsey is deducible over ATR 0 from the axiom of ∑ 1 1 monotone inductive definition,but the reversal needs П 1 1 - CA 0 rather than ATR 0 . By contrast, we show in this paper that the statement that all ∑ 0 2 games are determinate is also deducible over ATR 0 from the axiom of ∑ 1 1 monotone inductive definition, but the (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • [image] -Determinacy, Comprehension and Induction.Medyahya Ould Medsalem & Kazuyuki Tanaka - 2007 - Journal of Symbolic Logic 72 (2):452 - 462.
    We show that each of $\Delta _{3}^{1}-{\rm CA}_{0}+\Sigma _{3}^{1}-{\rm IND}$ and $\Pi _{2}^{1}-{\rm CA}_{0}+\Pi _{3}^{1}-{\rm TI}$ proves $\Delta _{3}^{0}-{\rm Det}$ and that neither $\Sigma _{3}^{1}-{\rm IND}$ nor $\Pi _{3}^{1}-{\rm TI}$ can be dropped. We also show that neither $\Delta _{3}^{1}-{\rm CA}_{0}+\Sigma _{\infty}^{1}-{\rm IND}$ nor $\Pi _{2}^{1}-{\rm CA}_{0}+\Pi _{\infty}^{1}-{\rm TI}$ proves $\Sigma _{3}^{0}-{\rm Det}$. Moreover, we prove that none of $\Delta _{2}^{1}-{\rm CA}_{0}$, $\Sigma _{3}^{1}-{\rm IND}$ and $\Pi _{2}^{1}-{\rm TI}$ is provable in $\Delta _{1}^{1}-{\rm Det}_{0}={\rm ACA}_{0}+\Delta _{1}^{1}-{\rm Det}$.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Δ 0 3 -determinacy, comprehension and induction.MedYahya Ould MedSalem & Kazuyuki Tanaka - 2007 - Journal of Symbolic Logic 72 (2):452-462.
    We show that each of Δ13-CA0 + Σ13-IND and Π12-CA0 + Π13-TI proves Δ03-Det and that neither Σ31-IND nor Π13-TI can be dropped. We also show that neither Δ13-CA0 + Σ1∞-IND nor Π12-CA0 + Π1∞-TI proves Σ03-Det. Moreover, we prove that none of Δ21-CA0, Σ31-IND and Π21-TI is provable in Δ11-Det0 = ACA0 + Δ11-Det.
    Download  
     
    Export citation  
     
    Bookmark   13 citations