Abstract:This paper studies the limits of recursive classifications in proof theory and program extraction, using the refined $A$-translation as a central example. The refined $A$-translation, due to Berger, Buchholz, and Schwichtenberg, is based on recursively defined classes of formulas in minimal arithmetic $\mathsf{MA}^\omega$, in particular the classes of definite and goal formulas. One of its basic properties is that $D[\bot := F] \to D$ is derivable for every definite formula $D$.
Schwichtenberg and Wainer observed that this property also holds for formulas outside the class of definite formulas and asked for a useful characterization of all formulas $D$ for which $D[\bot := F] \to D$ is derivable. In addition to definite formulas, the refined $A$-translation involves three further classes of formulas satisfying related properties. We show that none of these four properties admits a recursive characterization.
In addition to this negative result, we extend the framework of refined $A$-translation in two directions. First, we add conjunction $\wedge$ to the language of $\mathsf{MA}^\omega$, whose original formulation contains only the logical connectives $\forall$ and $\to$, and adapt the formula classes accordingly. Second, we present the corresponding slightly extended formulation of the refined $A$-translation theorem and discuss possible recursive extensions of these classes.
Finally, we discuss a prover written in Rust which implements the theory $\mathsf{MA}^\omega$ and the four formula classes. The prover is not used as a formal verification of the results, but serves as a case study for examining Rust as a programming language for proof assistants. We highlight some advantages and drawbacks of Rust in this setting, including its type system, support for partial constructions, ownership and borrowing model, modularity, and testing infrastructure.
| Comments: | 19 pages, 0 figures |
| Subjects: | Logic (math.LO) |
| MSC classes: | 03F03, 03F07, 03F30, 03F35, 03F50, 03B70, 68V15 |
| ACM classes: | F.4.1 |
| Cite as: | arXiv:2605.20452 [math.LO] |
| (or arXiv:2605.20452v2 [math.LO] for this version) | |
| https://doi.org/10.48550/arXiv.2605.20452 arXiv-issued DOI via DataCite |
From: Franziskus Wiesnet [view email]
[v1]
Tue, 19 May 2026 20:05:56 UTC (24 KB)
[v2]
Fri, 22 May 2026 13:13:12 UTC (27 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。