An LKProof containing the instances in et in its end sequent
A MultiExpansionTree whose shallow formula is prenex and which contains no strong or Skolem quantifiers.
A proof starting with s1 and ending with the deep formula of met.
An LKProof containing the instances in mes in its end sequent.
A MultiExpansionSequent in which all shallow formulas are prenex and which contains no strong or Skolem quantifiers.
A proof starting with s1 and ending with the deep sequent of mes.
An LKProof containing the instances in et in its end sequent
An ExpansionTree whose shallow formula is prenex and which contains no strong or Skolem quantifiers.
A proof starting with s1 and ending with the deep formula of et.
An LKProof containing the instances in es in its end sequent.
An ExpansionSequent in which all shallow formulas are prenex and which contains no strong or Skolem quantifiers.
A proof starting with s1 and ending with the deep sequent of es.
Computes a proof of F from a proof of some instances of F