AI RESEARCH
Do LLMs Game Formalization? Evaluating Faithfulness in Logical Reasoning
arXiv CS.AI
•
ArXi:2604.19459v1 Announce Type: new Formal verification guarantees proof validity but not formalization faithfulness. For natural-language logical reasoning, where models construct axiom systems from scratch without library constraints, this gap between valid proofs and faithful translations is especially acute. We investigate whether frontier models exploit this gap when generating Lean 4 proofs, a behavior we term formalization gaming.