Extension to other modal logics
Modal logics of sabotage revisited
... We leave it to the reader to recompute the earlier example in terms of pointed models, and check that we now get the intended interpretation. The system obtained in this way is not a simple extension of the ...
40
Clausal Resolution for Modal Logics of Confluence
... [RES p,q,r,s a ] ∗ (l ⇒ ♦ a p a r l 0 ) ∗ (l ⇒ a r ♦ a s l 0 ) which requires search for clauses that correspond to the normal form of the premise and the introduction of as many new definition symbols as the number of ...
15
Proof theory of quantified modal logics
... the extension of terms are made. In modal semantics that are based on trans-world identity, if terms are rigid designators, this distinction is irrelevant since terms denote the same object in all ...
167
PP 2015 12: Modal Logics and Multiverses
... Recently, a new view, called the multiverse view, was proposed by Hamkins [17]: on the multiverse view, Cohen’s result is not a problem, but rather (part of) the answer. Set theorists gain understanding about the truth ...
19
Proof theory for quantified monotone modal logics
... first-order extension, with both varying and constant domains, of monotone non-normal modal logics, and studies the role of the Barcan Formulas in these ...
30
PP 2016 28: Modal Logics of Sabotage Revisited
... all logics that we are discussing here, all changes take place definably inside first- order ...to other worlds where local changes took ...In modal terms, we can use devices from hybrid ...
38
PP 2004 15: Modal Logics for Products of Topologies
... A very natural extension of the language would be with the common knowledge operator. In the standard Kripke setting, there are several ways of defining common knowledge that all turn out to be equivalent (see ...
19
Undecidability of the unification and admissibility problems for modal and description logics
... normal modal logic L between K u and K4 u is ...various modal logics in which the universal modality is ...the extension of propositional dynamic logic with the converse constructor on pro- ...
18
Incremental decision procedures for modal logics with nominals and eventualities
... 1 Introduction we establish all the necessary small model properties within our framework. We begin by formulating and proving correct a Pratt-style abstract decision procedure for test-free PDL. When we then extend this ...
160
MoL 2004 09: A Construction Method for Modal Logics of Space
... As a note before moving on, one surprising feature of moving to richer modal languages is how difficult the problems become, even when seemingly increasing the expressive power only slightly. For example, L 2 F P ...
52
Conglomerating First Order, Descriptive and Modal Logics into Semantic Web – A Research
... The critical detail in growing software program program based totally on DLs is the usability of the understanding based honestly device and the object offer a summative technique which has made a huge contribution for ...
7
PP 2018 09: A Study of Subminimal Logics of Negation and their Modal Companions
... an extension of classical modal logic (see [28]) which is based on the rule p ↔ q / p ↔ ...intuitionistic modal logic that—as far as we know—has not been previously ...non-standard’ modal ...
21
Relevant logics, modal logics and theory change
... Deontic and epistemic logics based on relevant logics are presented in chapter three and chapter four contains an extensive investigation of the logic of theory cha[r] ...
11
An Institution of Modal Logics for Coalgebras
... within modal logic 2 [4], when seeking to formalise bisimulation-invariant properties of system states it is natural to consider log- ics which are modal in ...such logics have been studied in recent ...
31
Modular Construction of Modal Logics
... given modal operators exactly once, and subsequently closing under propositional ...In other words, a proof system constructor specifies how we can lift sequents to formulas containing an extra degree of ...
16
On the relative succinctness of some modal logics
... e.g., [51], where, in the wording above, the length of the expression R k is logarithmic in k while the length of P k is linear in k. Of course, this case is covered by Lemma 3.10. We finish this subsection with some ...
135
Failure of interpolation in combined modal logics
... combining logics is that of transfer theorems: under which conditions does a metalogical property |like nite axiomatisability, decidability or interpolation| transfer to the combined ...of modal ...
23
Expressiveness of probabilistic modal logics, revisited
... the game then proceeds in the same fashion. Before we formally prove the correctness of this game, let us spend a moment to consider what makes a game-theoretic characterization “elegant”. In our opinion, the classical ...
13
Forgetting in Multi-Agent Modal Logics
... Zhang and Zhou’s semantic definition of forgetting coin- cides with that of existential bisimulation quantifiers. Bisim- ulation quantifiers were introduced by Ghilardi and Zawad- owski [1995] to study uniform ...
8
Post Completeness in Congruential Modal Logics
... that logics, un- derstood as sets of formulas, are not Post complete simpliciter, but only Post complete relative to a given set of ...propositional modal logic operates on such an assumption, considering ...
14