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.
Untersuchungen über das logische Schließen. I
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
The paper introduces an extended unification-based proof search procedure for first-order sequent calculi that treat syntactic equality as a logical connective with introduction rules.
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.
-
Automating proof search when equality is a logical connective
The paper introduces an extended unification-based proof search procedure for first-order sequent calculi that treat syntactic equality as a logical connective with introduction rules.