The determinacy strength of Π21-comprehension

被引：4

作者：

Heinatsch, Christoph ^{[1
]}

Moellerfeld, Michael ^{[1
]}

机构：

[1] Univ Munster, D-4400 Munster, Germany

来源：

ANNALS OF PURE AND APPLIED LOGIC | 2010年 / 161卷 / 12期

关键词：

Reverse mathematics; Determinacy; Second-order arithmetic;

D O I：

10.1016/j.apal.2010.04.012

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Determinacy axioms state the existence of winning strategies for infinite games played by two players on natural numbers. We show that a base theory enriched by a certain scheme of determinacy axioms is proof-theoretically equivalent to Pi(1)(2)-comprehension. (C) 2010 Elsevier BM. All rights reserved.

引用

页码：1462 / 1470

页数：9

共 10 条

[1] Bradfield JC, 1999, LECT NOTES COMPUT SC, V1683, P350
[2] HEINATSCH C, 2003, THESIS MUNSTER
[3] Kechris A. S., 1995, Graduate Texts in Mathematics, V156
[4] MARTIN DA, PROVING DET IN PRESS
[5] Δ03-determinacy, comprehension and induction
Medsalem, Medyahya Ould
Tanaka, Kazuyuki
[J]. JOURNAL OF SYMBOLIC LOGIC, 2007, 72 (02) : 452 - 462
[6] MEDSALEM T, 2008, P COMP PROSP INF, P333
[7] MOLLERFELD M, 2002, THESIS MUNSTER
[8] MOSCHOWAKIS YN, 1980, STUDIES LOGIC FDN MA, V100
[9] Simpson S.G., 1999, SUBSYSTEMS 2 ORDER A
[10] WEAK AXIOMS OF DETERMINACY AND SUBSYSTEMS OF ANALYSIS II (SIGMA-2(0) GAMES)
TANAKA, K
[J]. ANNALS OF PURE AND APPLIED LOGIC, 1991, 52 (1-2) : 181 - 193

← 1 →