1
Lean Meets Theoretical Computer Science: Scalable Synthesis of Theorem Proving Challenges in Formal-Informal Pairs
结合Lean与理论计算机科学,可规模生成形式-非形式配对的定理证明挑战,助力AI数学推理研究。
arXiv:2508.15878v2 Announce Type: replace-cross Abstract: Formal theorem proving (FTP) has emerged as a critical foundation for evaluating the reasoni…