64 search results - page 11 / 13 » Cut elimination in coalgebraic logics |
189
click to vote
TABLEAUX
2009
Springer
16 years 17 days ago
2009
Springer
We consider two sequent calculi for tense logic in which the syntactic judgements are nested sequents, i.e., a tree of traditional onesided sequents built from multisets of formula...
156
click to vote
CSL
2005
Springer
15 years 11 months 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...
185
click to vote
JAR
2010
15 years 4 months ago
2010
Meta-logics and type systems based on intuitionistic logic are commonly used for specifying natural deduction proof systems. We shall show here that linear logic can be used as a m...
172
click to vote
AIML
2008
15 years 7 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
151
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...