We are going to show that the standard notion of Kripke completeness is the strongest one among many provably distinct algebraically motivated completeness properties, some of whic...
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
In this paper we give the notion of modularity of a theory and analyze some of its properties, especially for the case of action theories in reasoning about actions. We propose alg...
The family of normal propositional modal logic systems are given a highly systematic organisation by their model theory. This model theory is generally given using Kripkean frame s...
In this paper we study the relation between two approaches to information change: Dynamic Epistemic Logic and Belief Revision. One of the main differences between these approaches...
Hans P. van Ditmarsch, Wiebe van der Hoek, Barteld...
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
We study and give a summary of the complexity of 15 basic normal monomodal logics under the restriction to the Horn fragment and/or bounded modal depth. As new results, we show tha...
This paper aims to examine Horty's proposal of utilitarian deontic logic [7]. It will focus on his dominance operators by way of simplified semantics. An axiomatization of the...
abstract. Analytical investigations of agency are mostly concerned with a description ex post acto. However, continuous action (being doing something) needs to be considered as wel...