Standardized Proof Text as a Symbolic Computation Object and a Specification Source for LLM Training
Received: 29 Oct 2026 Accepted: 09 Nov 2026
Published: 2026, vol. 30, issue 4, pp. 454–458
Abstract
The paper addresses the lack of unified standards for the logical presentation of mathematical proofs. Drawing an analogy between mathematical text and program code, and building on the principles of Clean Code and formal logic, we propose a unified standard for writing definitions, theorem statements, and proofs. We discuss the possibility of representing a proof text constructed according to the proposed rules as a formal object — a derivation in the grammar of steps — and outline how such an object could be synthesized by a symbolic solver and checked by a verifier. The description of the standard’s rules can serve as a structured specification (a prompt) for training a specialized LLM that generates proof sketches under the control of symbolic verification.
Keywords: symbolic computation, mathematical logic, proof structure, standardization, proof synthesis, verification, large language models, formalization.
BibTeX
@article{IS-Kazakov2026,
author = {Kazakov, Ilia Borisovich},
title = {{Standardized Proof Text as a Symbolic Computation Object and a Specification Source for LLM Training}},
journal = {Intelligent Systems. Theory and Applications},
year = {2026},
volume = {30},
number = {4},
pages = {454--458},
}
AMSBIB
\Bibitem{IS-Kazakov2026}
\by I.\,B.~Kazakov
\paper Standardized Proof Text as a Symbolic Computation Object and a Specification Source for LLM Training
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 454--458
\lang In Russian
RU