##
**CERES**^{ω}

^{ω}

### Summary

is an extension of CERES to higher order logic. Please be sure to read the material on CERES before continuing. On this page, we will focus on the description of the differences between and . For details on , please see Hetzl, Leitsch, Weller and Woltzenlogel Paleo 2009, Weller 2010 and Hetzl, Leitsch and Weller 2011.

The system included in the generic architecture for proofs framework contains the implementation of the method, which at the moment provides the sequent calculus and the characteristic sequent set computation for higher order proofs.

### The method

The method proceeds analogously to the CERES method for first-order logic.
As input, the method takes a proof in a higher-order version of , which
is the usual with additional higher-order quantifier rules

for all higher-order quantifiers, where and are terms, and is a variable, and all are of appropriate types. -reduction is implicit, and all formulas in a proof are in -normal form.

Such a proof is translated into a proof in the calculus (which is the step corresponding to
the Skolemization transformation in first-order CERES). This calculus operates on labelled sequents written
,
which are usual higher-order sequents where to every formula in the sequent, a multiset of terms called a *label* is associated.
is essentially , where the eigenvariable condition is removed and instead, Skolem terms
are introduced. The arguments of the Skolem functions are tracked by the labels. This yields the quantifier rules

where and is a Skolem function.

From such an -proof , a set of labelled sequents ,
the *characteristic sequent set*, can be extracted (which corresponds to the *characteristic clause set* of first-order CERES).
Finally, the calculus

is used to refute the characteristic sequent set. From such a refutation, a cut-free proof of the original end-sequent can be computed.