144 search results - page 8 / 29 » On meta complexity of propositional formulas and proposition... |
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
TLCA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
ENTCS
2006
13 years 8 months ago
2006
This paper presents a game semantics for LP, Artemov's Logic of Proofs. The language of LP extends that of propositional logic by adding formula-labeling terms, permitting us...
APAL
1999
13 years 8 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...