Publications

• [1]George Barmpalias.Subclass of effective supermartingales: completeness.Preprint
• [2]A computable analysis of majorizing martingale.Accepted by Bulletin of the London Mathematical Society
• [3]RT22 does not imply WKL0.Journal of Symbolic Logic, 2012, 77 (2) : 609-620.
• [4]Cone avoid closed sets.Transactions of the American Mathematical Society, 367 (3) : 1609-1630.
• [5]Benoit Monin, Ludovic Patey.A computable analysis of variable words theorems[J].Proceedings of the American Mathematical Society, 2019, 147 (2) : 823-834.
• [6]Bjorn Kjos-Hansen.Extracting randomness within a subset is hard[J].European Journal of Mathematics, 2019: 1-14.
• [7]Chi Tat Chong, Wei Li, Yue Yang.The Strength of Ramsey's Theorem For Pairs over trees: I. Weak K\"onig's Lemma.Accepted by Transaction of the American Mathematical Society
• [8]Which DNR can be minimal.Arxiv 1912.09053
• [9]Avoid Schnorr randomness.Arxiv 1912.09052