On Martin's pointed tree theorem

被引：0

作者：

Hoelzl, Rupert ^{[1
]}

Stephan, Frank ^{[2
]}

Yu, Liang ^{[3
]}

机构：

[1] Heidelberg Univ, Inst Informat, Neuenheimer Feld 294, D-69120 Heidelberg, Germany

[2] Natl Univ Singapore, Dept Math, Fac Sci, Block S17,10 Lower Kent Ridge Rd, Singapore 119076, Singapore

[3] Nanjing Univ, Dept Math, 22 Hankou Rd, Nanjing 210093, Jiangsu, Peoples R China

来源：

COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE | 2016年 / 5卷 / 02期

关键词：

Reverse mathematics; algorithmic randomness; Martin's pointed tree theorem; weak Martin's pointed tree theorem;

D O I：

10.3233/COM-150047

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We investigate the reverse mathematics strength of Martin's pointed tree theorem (MPT) and one of its variants, weak Martin's pointed tree theorem (wMPT).

引用

页码：147 / 157

页数：11

共 20 条

[1]

Blass A., 1972, DISCRETE MATH, V3, P295, DOI DOI 10.1016/0012-365X(72)90086-6

[2] Maximal chains in the Turing degrees [J].

Chong, C. T. ;

Yu, Liang .

JOURNAL OF SYMBOLIC LOGIC, 2007, 72 (04) :1219-1227

[3]

Downey RG, 2010, THEOR APPL COMPUT, P401, DOI 10.1007/978-0-387-68441-3

[4] ANALYTIC DETERMINACY AND O-SHARP [J].

HARRINGTON, L .

JOURNAL OF SYMBOLIC LOGIC, 1978, 43 (04) :685-693

[5] BASIS RESULT FOR SIGMA-3(0) SETS OF REALS WITH AN APPLICATION TO MINIMAL COVERS [J].

HARRINGTON, LA ;

KECHRIS, AS .

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1975, 53 (02) :445-448

[6] PI 0/1 CLASSES AND DEGREES OF THEORIES [J].

JOCKUSCH, CG ;

SOARE, RI .

TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1972, 173 (446) :33-56

[7]

LERMAN M, 1983, PERSPECTIVES MATH LO

[8] AXIOM OF DETERMINATENESS AND REDUCTION PRINCIPLES IN ANALYTICAL HIERARCHY [J].

MARTIN, DA .

BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1968, 74 (04) :687-+

[9]

Martin Donald A., 1989, J AM MATH SOC, V2, P71, DOI 10.2307/1990913

[10] On initial segment complexity and degrees of randomness [J].

Miller, Joseph S. ;

Yu, Liang .

TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2008, 360 (06) :3193-3210

← 1 2 →