教师信息

主要课程

简明微积分,数理逻辑,可计算性与可判定性(计算机系)

个人简介

Yinhe Peng and Liang Yu,  TD  implies CCR.  Advances in Mathematics, Volume 384,  June 2021. 


Arno Pauly, Linda Westrick and Liang Yu, Luzin's (N) and randomness reflection.  The Journal of Symbolic Logic, Volume 87, Issue 2, June 2022,  802-828.

 
Meng Ng, Frank Stephan, Yue Yang  and Liang Yu, On Trees without Hyperimmune Branches.  Revolutions and Revelations in Computability: 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11–15, 2022, Proceedings. 


Yinhe Peng, Liuzhen Wu, and  Liang Yu, Some consequences of $\TD$ and $\sTD$, JSL, The Journal of Symbolic Logic. 2023;88(4):1573-1589.

教育经历

工作经历

研究兴趣

学术兼职

学术奖励

论文

CT Chong and Liang Yu. Measure-theoretic applications of higher Demuth's theorem. Trans. Amer. Math. Soc. 368 (2016), pp. 8249-8265.


 Liang Yu and Yizheng Zhu. On the reals which cannot be random. Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, Lecture Notes in Computer Science, 611--622, Vol.10010, 2017.


Mariam Beriashvili, Ralf Schindler, Liuzhen Wu, Liang Yu, Hamel bases and well-ordering the continuum, Proceedings of AMS, Volume 146, Number 8, August 2018, Pages 3565–3573.


Wolfgang Merkle, Liang Yu, Being low along a sequence and elsewhere, The Journal of Symbolic Logic, Volume 84, Issue 2 June 2019 , pp. 497-516.


CT Chong, Liuzhen Wu and Liang Yu, BASIS THEOREMS FOR $\Sigma^1_2-SETS,  The Journal of Symbolic Logic, 11 February 2019, pp. 376-387



其他