265 search results - page 13 / 53 » Weakly Algebraizable Logics |
110
click to vote
FROCOS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this paper we report on a novel approach for uniform encoding of hash functions (but also other cryptographic functions) into propositional logic formulae, and reducin...
109
click to vote
TARK
2009
Springer
15 years 8 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 ...
125
Voted
CONCUR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We consider linear time temporal logic enriched with semiextended regular expressions through various operators that have been proposed in the literature, in particular i...
116
click to vote
CADE
2006
Springer
16 years 2 months ago
2006
Springer
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicati...
133
click to vote
AIML
2008
15 years 3 months ago
2008
A logic LTD is defined, inspired by [37]. It is syntactically like basic modal logic with an additional unary operator but it has an interval-based semantics on structures with arb...