## Abstract 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. RCA~0~ ⊢ $ \Delta^0\_1 $‐Det\* ↔ $ \Sigma^0\_1 $‐Det\* ↔ WKL~0~. 2. RCA~0~ ⊢ ($ \Sigma^0\_1 $)2‐Det\* ↔
Determinacy of Wadge classes and subsystems of second order arithmetic
✍ Scribed by Takako Nemoto
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 274 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
In this paper we study the logical strength of the determinacy of infinite binary games in terms of second order arithmetic. We define new determinacy schemata inspired by the Wadge classes of Polish spaces and show the following equivalences over the system RCA~0~*, which consists of the axioms of discrete ordered semi‐rings with exponentiation, Δ~1~^0^ comprehension and Π~0~^0^ induction, and which is known as a weaker system than the popularbase theory RCA~0~:
-
Bisep(Δ~1~^0^, Σ~1~^0^)‐Det* ↔ WKL~0~,
-
Bisep(Δ~1~^0^, Σ~2~^0^)‐Det* ↔ ATR~0~ + Σ~1~^1^ induction,
-
Bisep(Σ~1~^0^, Σ~2~^0^)‐Det* ↔ Sep(Σ~1~^0^, Σ~2~^0^)‐Det* ↔ Π~1~^1^‐CA~0~,
-
Bisep(Δ~2~^0^, Σ~2~^0^)‐Det* ↔ Π~1~^1^‐TR~0~,
where Det* stands for the determinacy of infinite games in the Cantor space (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
📜 SIMILAR VOLUMES
## Abstract In this paper, we discuss uniform versions of some axioms of second order arithmetic in the context of higher order arithmetic. We prove that uniform versions of weak weak König's lemma WWKL and Σ^0^~1~ separation are equivalent to (∃^2^) over a suitable base theory of higher order arit
## Abstract In this paper, we have extended the existing results on the admissible set of periodic symbolic sequences of a second‐order digital filter with marginally stable system matrix to the unstable case. Based on this result, the initial conditions can be computed using the symbolic sequences