Sciweavers

265 search results - page 13 / 53
» Weakly Algebraizable Logics
Sort
View
FROCOS
2005
Springer
14 years 2 months ago
Logical Analysis of Hash Functions
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...
Dejan Jovanovic, Predrag Janicic
TARK
2009
Springer
14 years 3 months ago
A logical characterization of iterated admissibility
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty ...
Joseph Y. Halpern, Rafael Pass
CONCUR
2007
Springer
14 years 2 months ago
Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
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...
Martin Lange
CADE
2006
Springer
14 years 9 months ago
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicati...
Roy Dyckhoff, Delia Kesner, Stéphane Lengra...
AIML
2008
13 years 10 months ago
Modal logic of time division
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...
Tero Tulenheimo