Mathematical reasoning and proof auditing
Can a system tell an invalid step from one that is merely compressed?
Studying whether reasoning systems can produce, inspect, and repair mathematically valid arguments rather than merely plausible final answers. The interesting cases are not arithmetic slips but arguments that read well and quietly depend on something never established.
