On Martin’s pointed tree theorem

Article type: Research Article

Authors: Hölzl, Rupert^a | Stephan, Frank^b | Yu, Liang^c

Affiliations: [a] Institut für Informatik, Universität Heidelberg, Im Neuenheimer Feld 294, Heidelberg 69120, Germany. r@hoelzl.fr. http://hoelzl.fr | [b] Department of Mathematics, Faculty of Science, National University of Singapore, Block S17, 10 Lower Kent Ridge Road, Singapore 119076, Singapore. fstephan@comp.nus.edu.sg. http://www.comp.nus.edu.sg/~fstephan/ | [c] Department of Mathematics, Nanjing University, 22 Hankou Road, Nanjing 210093, P.R. China. yuliang.nju@gmail.com. http://ims.nju.edu.cn/~yuliang

Abstract: 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).

Keywords: Reverse mathematics, algorithmic randomness, Martin’s pointed tree theorem, weak Martin’s pointed tree theorem

DOI: 10.3233/COM-150047

Journal: Computability, vol. 5, no. 2, pp. 147-157, 2016