Proof schemata are infinite sequences of proofs which are defined inductively. In this paper we present a general framework for schemata of terms, formulas and unifiers and define a resolution calculus for schemata of quantifier-free formulas. The new calculus generalizes and improves former approaches to schematic deduction. As an application of the method we present a schematic refutation formalizing a proof of a weak form of the pigeon hole principle.

中文翻译：

---

公式图式的图解反驳

证明模式是归纳定义的无限证明序列。在本文中，我们提出了术语、公式和统一词的图式的一般框架，并定义了无量词公式的图式的分解演算。新的微积分概括并改进了以前的示意图演绎方法。作为该方法的应用，我们提出了一个示意性的反驳，将鸽巢原理的弱形式的证明形式化。