Please use this identifier to cite or link to this item: https://doi.org/10.3233/COM-150047
Title: On Martin's pointed tree theorem
Authors: Hölzl R. 
Stephan F. 
Yu L.
Keywords: algorithmic randomness
Martin's pointed tree theorem
Reverse mathematics
weak Martin's pointed tree theorem
Issue Date: 2016
Publisher: IOS Press
Citation: Hölzl R., Stephan F., Yu L. (2016). On Martin's pointed tree theorem. Computability 5 (2) : 147-157. ScholarBank@NUS Repository. https://doi.org/10.3233/COM-150047
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). © 2016 - IOS Press and the authors. All rights reserved.
Source Title: Computability
URI: https://scholarbank.nus.edu.sg/handle/10635/177539
ISSN: 2211-3568
DOI: 10.3233/COM-150047
Appears in Collections:Staff Publications
Elements

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
Hoelzl, Stephan, Yu - On Martin's Pointed Tree Theorem.pdf182.64 kBAdobe PDF

OPEN

Post-printView/Download

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.