On lengths of proofs in non-classical logics (Q1006613): Difference between revisions

In a pair of recent papers [J. Symb. Log. 72, No. 3, 941--958 (2007; Zbl 1125.03043)], [Ann. Pure Appl. Logic 146, No.~1, 72--90 (2007; Zbl 1115.03081)], the author proved a version of the feasible monotone interpolation property for some propositional proof systems of modal logic and intuitionistic logic, which implies an exponential lower bound for the systems in question. The original proof relied on a complicated model-theoretic construction. In the present paper, the author gives a considerably simpler proof of a more general feasible monotone interpolation theorem for K and intuitionistic logic, using a representation of modal axioms and rules by Horn clauses. The result implies exponential lower bounds on both the number of distributivity axioms and the number of necessitation rules in proofs of variants of the clique-coloring tautologies.