Naumov, Pavel (2008) On meta complexity of propositional formulas and propositional proofs. Archive for Mathematical Logic, 47 (1), 35-52. (doi:10.1007/s00153-008-0068-4).
Abstract
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.
This record has no associated files available for download.
More information
Identifiers
Catalogue record
Export record
Altmetrics
Contributors
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.