picks one occurrences from the candidates s.t.
picks one occurrences from the candidates s.t. formulas (if it exists) are identical.
the index of a fitting formulas for aux
picks one occurrences from the candidates s.t.
picks one occurrences from the candidates s.t. formulas (if it exists) are identical
the proof which is used as template
an index into p.endSequent
a list of candidate formulas to pick a match for aux
the index of a fitting formulas for aux
picks 1 occurrence from the same list s.t.
picks 1 occurrence from the same list s.t. ac1 != ac2, where formulas and skolem label agree
a pair of index and remaining candidates
picks 2 occurrences from the same list s.t.
picks 2 occurrences from the same list s.t. ac1 != ac2, where formulas and skolem label agree
a list with the indices of a fitting formulas for aux1 / aux2
picks 2 occurrences from the same list s.t.
picks 2 occurrences from the same list s.t. ac1 != ac2, where formulas and skolem label agree
a list with the indices of a fitting formulas for aux1 / aux2
For a rule p with parent sequents ps and auxiliary formulas aux, pick a fitting formula for each aux formula in the correct part of the sequent.
For a rule p with parent sequents ps and auxiliary formulas aux, pick a fitting formula for each aux formula in the correct part of the sequent. E.g. if p is an implication right rule, aux(0) will be picked from the antecedent of ps(0) and aux(1) will be picked from the succedent of ps(0).
The proof which rule should be simulated, we assume we want to mirror the inference to create a similar proof p'
The parents of p.
The intended parents for p'
The indices of the auxiliary formulas in the parents
a list of indices in new_parents where the formulas match old_aux
The pick* functions generalize the convenience constructors of the LK rules which allow to specify arguments by a formula instead of an index. Here we lookup fitting matches for the auxiliary formulas of each LK rule. In the case of LK, fitting is defined as equality of the formula. In the case of LKsk, it is equality of formulas and skolem labels. An algorithm using pickrule is therefore easier to transfer to LKsk.