A Complexity Gap for Tree-Resolution
DOI:
https://doi.org/10.7146/brics.v6i29.20098Resumé
It is shown 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.
Actually it is shown that the gap-phenomena is valid for tautologies based
on infinite mathematical theories (i.e. not just based on a single proposition).
We clarify the link between translating combinatorial principles (or
more general statements from predicate logic) and the recent idea of using
the symmetrical group to generate problems of propositional logic.
Finally, we show that it is undecidable whether a sequence psi_n (of the
kind we consider) has polynomial size tree-resolution proofs or requires
exponential size tree-resolution proofs. Also we show that the degree of
the polynomial in the polynomial size (in case it exists) is non-recursive,
but semi-decidable.
Keywords: Logical aspects of Complexity, Propositional proof complexity,
Resolution proofs.
Downloads
Publiceret
Citation/Eksport
Nummer
Sektion
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).