438 search results - page 27 / 88 » On theorem proving in annotated logics |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
As an attempt to uncover the topological nature of composition of strategies in game semantics, we present a "topological" game for Multiplicative Additive Linear Logic ...
DIAGRAMS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We have developed a diagrammatic logic for theorem proving, focusing on the domain of metric-space analysis (a geometric domain, but traditionally taught using a dry alge...
82
Voted
LFCS
1997
Springer
15 years 1 months ago
1997
Springer
The provability problem for the Horn fragment of linear logic is NP-complete [4, 1]. In this work we investigate various definitions of concurrency proposed in [2] and establish t...
94
Voted
ECCC
2008
14 years 9 months ago
2008
We show analogues of a theorem due to Valiant and Vazirani [16] for intractable parameterized complexity classes such as W[P], W[SAT] and the classes of the W-hierarchy as well as...
CSL
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...