39 search results - page 4 / 8 » Axiomatization and Completeness of Lexicographic Products of... |
AIML
2008
13 years 8 months ago
2008
We present a complete axiomatization of a logic denoted by MTML (Mereo-Topological Modal Logic) based on the following set of mereotopological relations: part-of, overlap, underlap...
AML
2010
13 years 7 months ago
2010
Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'. We ext...
AML
2006
13 years 7 months ago
2006
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
TARK
2009
Springer
14 years 1 months ago
2009
Springer
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty ...
24
Voted
ENTCS
2010
13 years 7 months ago
2010
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...