154 search results - page 3 / 31 » Proof Complexity of Non-classical Logics |
AIML
2004
13 years 7 months ago
2004
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
TARK
2009
Springer
14 years 4 days ago
2009
Springer
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
CIE
2008
Springer
13 years 7 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
FSTTCS
2005
Springer
13 years 11 months ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
LICS
2006
IEEE
13 years 11 months ago
2006
IEEE
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...