Non-elementary Speedups between Different Versions of Tableaux

We have shown that the use of the \(\delta ^{ + ^ + }\)-rule instead of the δ-rule and the (newly introduced) δ✶-rule instead of the \(\delta ^{ + ^ + }\)-rule, respectively, may lead to nonelementary shortenings of tableau-based derivations, without increasing the size of the tableaux in any case. These speedups are based on restrictions of the sets of variables on which the Skolem-functions depend, that are introduced by the quantifier elimination rules. The effect corresponds to the result of reducing the scope of quantifiers by shifting them over subformulae that do not contain the variable concerned.

[1]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[2]  Alexander Leitsch,et al.  Complexity of Resolution Proofs and Function Introduction , 1992, Ann. Pure Appl. Log..

[3]  Bernhard Beckert,et al.  The Even More Liberalized delta-Rule in Free Variable Semantic Tableaux , 1993, Kurt Gödel Colloquium.

[4]  Christian G. Fermüller,et al.  A non-elementary speed-up in proof length by structural clause form transformation , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[5]  R. Statman Lower bounds on Herbrand’s theorem , 1979 .

[6]  Donald W. Loveland,et al.  Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.