at.logic.gapt.proofs.expansion
Given an expansion sequent S, this algorithm computes a single expansion sequents below S that is valid and minimal. This algorithm is considerably faster than the one implemented in minimalExpansionSequents.
Applies the algorithm to a ExpansionSequent.
The ExpansionSequent to be evaluated.
The prover used for the evaluation.
A sequence of minimal expansion sequents.
Given an expansion sequent S, this algorithm computes a single expansion sequents below S that is valid and minimal. This algorithm is considerably faster than the one implemented in minimalExpansionSequents.