DeepAI AI Chat
Log In Sign Up

Schematic Refutations of Formula Schemata

02/21/2019
by   David Cerna, et al.
Johannes Kepler University Linz
Logic Industries
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/15/2018

A new coinductive confluence proof for infinitary lambda-calculus

We present a new and formal coinductive proof of confluence and normalis...
04/04/2018

Short Proofs for Some Symmetric Quantified Boolean Formulas

We exploit symmetries to give short proofs for two prominent formula fam...
04/25/2019

The Epsilon Calculus with Equality and Herbrand Complexity

Hilbert's epsilon calculus is an extension of elementary or predicate ca...
08/28/2021

Cirquent calculus in a nutshell

This paper is a brief and informal presentation of cirquent calculus, a ...
05/12/2022

Relating Information and Proof

In mathematics information is a number that measures uncertainty (entrop...
02/12/2021

Proof complexity of positive branching programs

We investigate the proof complexity of systems based on positive branchi...