On meta complexity of propositional formulas and propositional proofs

A new approach to defining complexity of propositional formulas and proofs is suggested. Instead of measuring the size of these syntactical structures in the propositional language, the article suggests to define the complexity by the size of external descriptions of such constructions. The main result is a lower bound on proof complexity with respect to this new definition of complexity.

• Type: Journal
• Year: 2008
• Where: AML
• Authors: Pavel Naumov
• Keywords: AML 2008, Propositional Formulas, Propositional Language, Syntactical Structures