A complexity gap for tree resolution

This paper shows that any sequence \( \psi_ n \) of tautologies which expresses the validity of a fixed combinatorial principle either is “easy”, i.e. has polynomial size tree-resolution proofs, or is “difficult”, i.e. requires exponential size tree-resolution proofs. It is shown that the class of tautologies which are hard (for tree resolution) is identical to the class of tautologies which are based on combinatorial principles which are violated for infinite sets. Further it is shown that the gap phenomenon is valid for tautologies based on infinite mathematical theories (i.e. not just based on a single proposition).¶A corollary to this classification is that it is undecidable whether a sequence \( \psi_ n \) has polynomial size tree-resolution proofs or requires exponential size tree-resolution proofs. It also follows that the degree of the polynomial in the polynomial size (in case it exists) is non-recursive, but semi-decidable.

Authors and Affiliations

1. Department of Computer Science, Queen Mary, University of London, London E1 4NS, United Kingdom, e-mail: smriis@dcs.qmw.ac.uk, http://www.dcs.qmw.ac.uk/~smriis/, , , , , , GB

   S. Riis

Received: November 8, 2000.

Reprints and permissions