[PDF] Top 20 PP 2008 30: Modal Logic and Invariance

... ing invariance, we start with basic logical operations (first-order quantifica- tion, modal or dynamic operators) and identify semantic properties of invari- ance which match these operations ...and ... See full document

... We provide sound and complete axioms for our instantial propositional dy- namic logic IPDL, prove decidability via finite model property, and establish bisimulation invariance. The latter amounts to ... See full document

... the modal logic literature [Marx, 2006; Areces et ...first-order logic, the modality h−ϕiψ essentially allows us to count, boosting the expressive power of monadic first-order logic to that of ... See full document

... Proof. Let M = (W , R, V) be a Kripke model, ϕ a GML formula. We first com- pute T = i(M), which we can do in time polynomial in |M| by assumption. We proceed by computing the modification product M × T , which we can do ... See full document

... intuitionistic logic ‘lies embedded in the epistemic logic S4’, which differs from the usual epistemic logics in having positive introspection (the axiom [] ϕ → [][] ϕ ), but not negative introspection, ... See full document

... relevant logic, which have often been given an informational ...relevant logic, which provides an abstract framework that can be specialized to combinatory logic, lambda calculus and proof theory, ... See full document

... with modal logic, this was not the mindset of the medieval ...medieval logic which could be called temporal logic, strictly ...modern logic, as a type of quantified temporal ... See full document

... are modal formulas (for example 2 ( 2 ⊥ ∨ 32 ⊥)) which are satisfied at one point but not the ...same modal formulas ...no modal formula holds in exactly those points w of models such that ... See full document

... medieval logic is of interest to the modern ...(modal logic, temporal logic, quantifier logic, ...medieval logic for either of these rea- sons will result in something ... See full document

... Van Benthem, van Eij k & Kooi 2006 [5℄ solve this problem by moving to the language E-PDL whi h is just the propositional dynami logi version of epistemi logi , but now allowing the form[r] ... See full document

... By substituting atom p in Formula 1 with a Boolean compound ϕ (i.e., ϕ := p ∧ q) we can say that “a belongs to both the sets called p and q”, and the same can be done for all other Boolean connectives. However, what is ... See full document

... distributive modal logics, in order to prove completeness results algebraically we will need to make some kind of link between dmas and ...frames. Modal logicians are used to obtain a frame from a ... See full document

... to modal operators preceding O, and enumerate them beginning from the one that is furthest and ending up with the one that is ...n-th modal operator in φ among those modal operators that precede O’ − ... See full document

... All of the preceding could be read as a study of information about some unchanging static situation which we do not know yet in its entirety, and at best, events informing us that given situation. But of course, real ... See full document

... ‘natural logic’ and ‘modern logic’ can coexist harmoniously, because both have their ...modern logic might even learn something from natural logic in combating its ‘system imprisonment’, ... See full document

... within the frameworks of ATL [4], Coalition Logic [12] and their extensions. These logics focus on what results groups can achieve and do not represent explicitly how exactly results can be achieved. Recently, ... See full document

... information update at both levels: worlds may be removed, but also, sentences may be added. In this setting, I will explore the idea that the fundamental distinction in the preceding discussion is not between ... See full document

... In the third chapter we first discuss which expressive powers a logic for the analysis of cryptographic protocols should have. We then show how to extend GG to Epistemic Crypto Logic (ECL) by enriching both ... See full document

... basic modal logic enables us to express and reason about the behaviour of state-based evolving systems in a manner that goes far beyond the more local properties that can be expressed in the basic ... See full document

... rather occurs with soft information concerning a proposition P, as mentioned above. This just increases our 'preference' for P-worlds, without totally abandoning the others. Soft information leads to plausibility change, ... See full document