Sciweavers

3239 search results - page 92 / 648
» A Logical Process Calculus
Sort
View
99
Voted
JLP
2008
81views more  JLP 2008»
15 years 19 days ago
Cut-free sequent systems for temporal logic
Currently known sequent systems for temporal logics such as linear time temporal logic and computation tree logic either rely on a cut rule, an invariant rule, or an infinitary ru...
Kai Brünnler, Martin Lange
GRAMMARS
2000
97views more  GRAMMARS 2000»
15 years 14 days ago
Proof-Nets, Hybrid Logics and Minimalist Representations
Inthis paper, we aim at giving alogical account of the representationalist view on minimalist grammars by refering to the notion of Proof-Net in Linear Logic. We propose at the sam...
Alain Lecomte
112
Voted
IANDC
2010
119views more  IANDC 2010»
14 years 11 months ago
Cut elimination in coalgebraic logics
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...
Dirk Pattinson, Lutz Schröder
AOSD
2010
ACM
15 years 7 months ago
A theory of distributed aspects
Over the last five years, several systems have been proposed to take distribution into account in Aspect-Oriented Programming. While they appeared to be fruitful to develop or im...
Nicolas Tabareau
103
Voted
TABLEAUX
1998
Springer
15 years 4 months ago
Fibring Semantic Tableaux
The methodology of fibring is a successful framework for combining logical systems based on combining their semantics. In this paper, we extend the fibring approach to calculi for ...
Bernhard Beckert, Dov M. Gabbay