On Martin’s pointed tree theorem

DOI10.3233/COM-150047zbMath1403.03018arXiv1404.2073MaRDI QIDQ5740206

Rupert Hölzl, Liang Yu, Frank Stephan

Publication date: 25 July 2016

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.2073

zbMATH Keywords

reverse mathematicsalgorithmic randomnessMartin's pointed tree theoremweak Martin's pointed tree theorem

Mathematics Subject Classification ID

Descriptive set theory (03E15) Foundations of classical theories (including reverse mathematics) (03B30) Algorithmic randomness and dimension (03D32) Determinacy principles (03E60)

Cites Work

• A model of set-theory in which every set of reals is Lebesgue measurable
• Complexity of winning strategies
• On initial segment complexity and degrees of randomness
• A Proof of Projective Determinacy
• A Basis Result for ∑ 0 3 Sets of Reals with an Application to Minimal Covers
• Analytic determinacy and 0^#
• Maximal chains in the Turing degrees
• The axiom of determinateness and reduction principles in the analytical hierarchy

This page was built for publication: On Martin’s pointed tree theorem