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.
Journal of Symbolic Computation7, 371–425 (1989)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.