Sciweavers

2128 search results - page 120 / 426
» A general characterization of indulgence
Sort
View
CSR
2008
Springer
15 years 4 months ago
A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics
An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of G...
Arnon Avron, Anna Zamansky
ENTCS
2007
80views more  ENTCS 2007»
15 years 4 months ago
Topological Perspective on the Hybrid Proof Rules
We consider the non-orthodox proof rules of hybrid logic from the viewpoint of topological semantics. Topological semantics is more general than Kripke semantics. We show that the...
Balder ten Cate, Tadeusz Litak
ACTA
2005
94views more  ACTA 2005»
15 years 4 months ago
The stuttering principle revisited
It is known that LTL formulae without the `next' operator are invariant under the so-called stutter-equivalence of words. In this paper we extend this principle to general LTL...
Antonín Kucera, Jan Strejcek
DLS
2010
162views Languages» more  DLS 2010»
15 years 2 months ago
Proxies: design principles for robust object-oriented intercession APIs
Proxies are a powerful approach to implement meta-objects in object-oriented languages without having to resort to metacircular interpretation. We introduce such a meta-level API ...
Tom Van Cutsem, Mark S. Miller
IBERAMIA
2010
Springer
15 years 2 months ago
A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
Teresa Alsinet, Ramón Béjar, Lluis G...