On Martin’s pointed tree theorem

Author:

Hölzl Rupert1,Stephan Frank2,Yu Liang3

Affiliation:

1. Institut für Informatik, Universität Heidelberg, Im Neuenheimer Feld 294, Heidelberg 69120, Germany. r@hoelzl.fr.

2. 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.

3. Department of Mathematics, Nanjing University, 22 Hankou Road, Nanjing 210093, P.R. China. yuliang.nju@gmail.com.

Publisher

IOS Press

Subject

Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science

Reference18 articles.

1. Complexity of winning strategies;Blass;Discrete Mathematics,1972

2. Maximal chains in the Turing degrees;Chong;The Journal of Symbolic Logic,2007

3. R.G. Downey and D.R. Hirschfeldt, Algorithmic Randomness and Complexity, Theory and Applications of Computability, Springer, New York, 2010.

4. Analytic determinacy and 0 ♯;Harrington;The Journal of Symbolic Logic,1978

5. A basis result for Σ 3 0 sets of reals with an application to minimal covers;Harrington;Proceedings of the American Mathematical Society,1975

全球学者库

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"全球学者库"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前全球学者库共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2023 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3