Eliminates a duplicate occurrence of a formula term1 from the succedent of a sequent. The two occurrences are automatically chosen; if term1 occurs less than twice, an exception is thrown. If term1 occurs more than twice, multiple applications of this function are needed to remove all duplicate occurrences. The rule: (rest of s1) sL |- sR, term1, term1 ----------------------- (ContractionRight) sL |- sR, term1
Eliminates a duplicate occurrence of a formula term1 from the succedent of a sequent. The two occurrences are automatically chosen; if term1 occurs less than twice, an exception is thrown. If term1 occurs more than twice, multiple applications of this function are needed to remove all duplicate occurrences. The rule: (rest of s1) sL |- sR, term1, term1 ----------------------- (ContractionRight) sL |- sR, term1
The top proof with (sL |- sR, term1, term1) as the bottommost sequent.
The formula whose duplicate occurrence is to be removed.
An LK Proof ending with the new inference.
Eliminates a duplicate occurrence of a formula F (marked by term1oc and term2oc) from the succecedent of a sequent.
Eliminates a duplicate occurrence of a formula F (marked by term1oc and term2oc) from the succecedent of a sequent. This method merely returns the changed sequent, not a proof.
The sequent (sL |- sR, F, F).
The first occurrence of F
The second occurrence of F
The sequent (sL |- sR, F).
Eliminates a duplicate occurrence of a formula F (marked by term1oc and term2oc) from the succedent of a sequent. The rule: (rest of s1) sL |- sR, F, F --------------- (ContractionRight) sL |- sR, F
Eliminates a duplicate occurrence of a formula F (marked by term1oc and term2oc) from the succedent of a sequent. The rule: (rest of s1) sL |- sR, F, F --------------- (ContractionRight) sL |- sR, F
The top proof with (sL |- sR, F, F) as the bottommost sequent.
The first occurrence of F
The second occurrence of F
An LK Proof ending with the new inference.