Adds a sequent of elements to the antecedent.
Adds a sequent of elements to the antecedent. New elements are always outermost, i.e. on the very left.
A collection of elements of type B > A.
The sequent with es added to the antecedent.
Adds an element to the antecedent.
Adds an element to the antecedent. New elements are always outermost, i.e. on the very left.
An element of type B > A
The sequent with e added to the antecedent
Adds an element to the succedent.
Adds an element to the succedent. New elements are always outermost, i.e. on the very right.
An element of type B > A
The sequent with e added to the succedent
Adds a sequence of elements to the succedent.
Adds a sequence of elements to the succedent. New elements are always outermost, i.e. on the very right.
A collection of elements of type B > A.
The sequent with es added to the succedent.
Adds an element to the antecedent.
Adds an element to the antecedent. New elements are always outermost, i.e. on the very left.
An element of type B > A
The sequent with e added to the antecedent
Adds an element to the succedent.
Adds an element to the succedent. New elements are always outermost, i.e. on the very right.
An element of type B > A
The sequent with e added to the succedent
The first list.
The first list.
Returns the element at some SequentIndex.
Returns the element at some SequentIndex.
A SequentIndex, i.e. Ant(k) or Suc(k)
The k-th element of the antecedent or succedent, depending on the type of i.
Returns true iff the sequent contains some element in either cedent.
Returns true iff the sequent contains some element in either cedent.
Takes the multiset difference between two sequents, i.e.
Takes the multiset difference between two sequents, i.e. each side separately.
Removes duplicate formulas from both cedents.
Removes duplicate formulas from both cedents.
Sequence of elements of the sequent.
Sequence of elements of the sequent.
Antecedent concatenated with succedent.
Equality treating each side of the sequent as list, i.e.
Equality treating each side of the sequent as list, i.e. respecting order and multiplicity.
The sub-sequent of elements satisfying some predicate.
The sub-sequent of elements satisfying some predicate.
A function of type A => Boolean.
The sequent consisting of only those elements satisfying p.
The sub-sequent of elements not satisfying some predicate.
The sub-sequent of elements not satisfying some predicate.
A function of type A => Boolean.
The sequent consisting of only those elements not satisfying p.
"Focuses on one element of the seuqent, i.e.
"Focuses on one element of the seuqent, i.e. returns element at index and the rest of the sequent.
A SequentIndex.
A pair consisting of this(i) and the rest of this.
Finds the first occurrence in this sequent having the given ancestor.
Finds the first occurrence in this sequent having the given ancestor.
Returns the range of indices of the sequent as a sequence.
Returns the range of indices of the sequent as a sequence.
Returns the range of indices of the sequent as a sequent.
Returns the range of indices of the sequent as a sequent.
Returns the list of indices of elements satisfying some predicate.
Returns the list of indices of elements satisfying some predicate.
A function of type A => Boolean.
Computes the intersection of two sequents.
Computes the intersection of two sequents.
Tests whether the sequent is defined at the supplied SequentIndex.
Tests whether the sequent is defined at the supplied SequentIndex.
Returns true iff both cedents are empty.
Returns true iff both cedents are empty.
Is this sequent of the form :- t = t?
Is this sequent of the form :- t = t?
Another Sequent.
True iff other contains this pair of sets.
Is this sequent of the form F :- F?
Is this sequent of the form F :- F?
The number of elements in the sequent.
The number of elements in the sequent.
A pair consisting of the lengths of the cedents.
A pair consisting of the lengths of the cedents.
Maps two functions over the antecedent and succedent, respectively.
Maps two functions over the antecedent and succedent, respectively.
The return type of f and g.
The function to map over the antecedent.
The function to map over the succedent.
The sequent of type B that results from mapping f and g over the antecedent and succedent, respectively.
Maps a function over both cedents
Maps a function over both cedents
The return type of f
A function of type A => B
The sequent of type B that results from mapping f over both cedents.
Equality treating each side of the sequent as a multiset.
Equality treating each side of the sequent as a multiset.
Occurrences on both sides of the sequent, i.e.
Occurrences on both sides of the sequent, i.e. the concatenation of antecedent and succedent.
Sequence of elements together with polarities of type Boolean signifying whether an element is in the antecedent or succedent.
Sequence of elements together with polarities of type Boolean signifying whether an element is in the antecedent or succedent.
FIXME: Make polarities consistent throughout the system (IMO: false = antecedent, true = succedent)
Removes the specified at.logic.gapt.proofs.occurrences.FormulaOccurrences from each side.
Removes the specified at.logic.gapt.proofs.occurrences.FormulaOccurrences from each side.
Equality treating each side of the sequent as a set.
Equality treating each side of the sequent as a set.
Synonym for length.
Synonym for length.
Synonym for lengths.
Synonym for lengths.
The second list.
The second list.
Equality treating each side as a multiset of formulas, ignoring the occurrence.
Equality treating each side as a multiset of formulas, ignoring the occurrence.
Equality treating each side as a multiset of formulas, ignoring the occurrence.
Equality treating each side as a multiset of formulas, ignoring the occurrence.
Interpretation of the sequent as formula.
Interpretation of the sequent as formula.
Converts to a HOLSequent, ignoring where the formulas occur.
Converts to a HOLSequent, ignoring where the formulas occur.
The sequent in tuple form.
Computes the union of two sequents.
Computes the union of two sequents.