On Different Structure-preserving Translations to Normal Form

1996 Journal of symbolic computation  
In this paper, we compare different definitional transformations into normal form with respect to the Herbrand complexity of the resulting normal forms. Usually, such definitional transformations introduce labels defining subformulae. An obvious optimization is to use implications instead of equivalences, if the subformula occurs in one polarity only, in order to reduce the length of the resulting normal form. We identify a sequence of formulae H 1 , H 2 , . . ., for which the difference of the
more » ... Herbrand complexity of the different translations of H k is bounded from below by a non-elementary function in k. If the optimized translation is applied instead of the unoptimized one, the length of any resolution or cut-free LK-proof of H k is non-elementary in k instead of exponential in k.
doi:10.1006/jsco.1996.0044 fatcat:nn2ls6cjlrbcfgcmacveels5oi