Abstract
We shall describe two general methods for proving lower bounds on the lengths of proofs in propositional calculus and give examples of such lower bounds. One of the methods is based on interactive proofs where one player is claiming that he has a falsifying assignment for a tautology and the second player is trying to convict him of a lie. The second method is based on boolean valuations. For the first method, a log n + log log n -O(logloglog n) lower bound is given on the lengths of interactive proofs of certain permutation tautologies.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have