3 papers
math.LO2026
Ranking theories via encoded -models
Hanul Jeon, Patrick Lutz, Fedor Pakhomov +1
Ranking theories according to their strength is a recurring motif in mathematical logic. We introduce a new ranking of arbitrary (not necessarily recursively axiomatized) theories…
math.LO2026
A Borel graphable equivalence relation with no Borel graphing of diameter two
Patrick Lutz
We answer a question of Arant, Kechris and Lutz by showing that there is a Borel graphable equivalence relation with no Borel graphing of diameter less than 3. More specifically, w…
cs.LG2025
Linear Transformers Implicitly Discover Unified Numerical Algorithms
Patrick Lutz, Aditya Gangrade, Hadi Daneshmand +1
We train a linear attention transformer on millions of masked-block matrix completion tasks: each prompt is masked low-rank matrix whose missing block may be (i) a scalar predictio…