Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

AML
2008

favoriteEmaildiscussreport

91views more AML 2008»

On meta complexity of propositional formulas and propositional proofs

13 years 11 months ago

On meta complexity of propositional formulas and propositional proofs

Download www2.mcdaniel.edu

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.

Pavel Naumov

Real-time Traffic

AML 2008 | Propositional Formulas | Propositional Language | Syntactical Structures |

claim paper

Related Content

» Complexity of Propositional Proofs Under a Promise

» A note on propositional proof complexity of some Ramseytype statements

» MeanPayoff Games and Propositional Proofs

» Does Advice Help to Prove Propositional Tautologies

» Algebraic Proofs over Noncommutative Formulas

» Examining fragments of the quantified propositional calculus

» Mining Propositional Simplification Proofs for Small Validating Clauses

» Parameterized Proof Complexity a Complexity Gap for Parameterized Treelike Resolution

» Propositional Logic for Circuit Classes

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2008
Where	AML
Authors	Pavel Naumov

Comments (0)