None of the four properties in the refined A-translation admits a recursive characterization; the framework is extended with conjunction and a Rust prover is presented as a case study.
Assumes Rust 1.90.0 or later and Rust 2024 Edition
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Limits of Recursive Characterizations in the Refined $A$-Translation
None of the four properties in the refined A-translation admits a recursive characterization; the framework is extended with conjunction and a Rust prover is presented as a case study.