2000 character limit reached
Schematic Refutations of Formula Schemata (1902.08055v3)
Published 21 Feb 2019 in cs.LO
Abstract: 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.