284 search results - page 9 / 57 » Modularity of Completeness Revisited |
JUCS
2006
13 years 9 months ago
2006
: We cast a new look on time-varying distributed H systems. In their original definition, where only new strings are passed to the next component, this language definition in itsel...
CONCUR
2004
Springer
14 years 3 months ago
2004
Springer
We present a modular approach to defining logics for a wide variety of state-based systems. We use coalgebras to model the behaviour of systems, and modal logics to specify behavi...
ENTCS
2006
13 years 9 months ago
2006
This paper gives an overview of recent results concerning the modular derivation of (i) modal specification logics, (ii) notions of simulation together with logical characterisati...
TABLEAUX
2009
Springer
14 years 4 months ago
2009
Springer
We see cut-free sequent systems for the basic normal modal logics formed by any combination the axioms d, t, b, 4, 5. These systems are modular in the sense that each axiom has a c...
CSL
2007
Springer
14 years 4 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...