154 search results - page 5 / 31 » Proof Complexity of Non-classical Logics |
CSL
2005
Springer
14 years 28 days ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
JACM
2002
13 years 7 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
FM
2003
Springer
14 years 19 days ago
2003
Springer
As the systems we have to specify and verify become larger and more complex, there is a mounting need to combine different tools and decision procedures to accomplish large proof ...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...