modal logic
A note on graded modal logic
... We introduce a notion of bisimulation for graded modal logic. Using these bisimulations the model theory of graded modal logic can be developed in a uniform manner. We illustrate this by ...
14
PP 2007 04: Situation Calculus Meets Modal Logic
... epistemic logic) and easy to equate with core theories ...by modal logic-style considerations of computational complexity is a bit like sensitivity to sin: some people have it, some do ...
17
X 2015 01: Bitopological Vietoris spaces and positive modal logic
... intuitionistic modal logic should ...classical modal logic is sound and complete with respect to the coalgebras for the Vietoris functor on the category of Stone space, the coalgebras for the ...
33
From topology to metric: modal logic and quantification in metric spaces
... of modal logics designed for reasoning about qualitative aspects of metric ...conditional logic, as well as logics of comparative ...the modal logic with the operator ‘closer to a set τ 0 than ...
20
PP 2002 09: A Sahlqvist Theorem for Distributive Modal Logic
... preserving modal- ities, respectively, whereas turns disjunctions into conjunctions, and vice versa, turns conjunctions into ...distributive modal logic or dml to be any set of sequents which ...
43
PP 2006 47: Approaches to Independence Friendly Modal Logic
... basic modal logic is enriched with the slash notation familiar from IF first-order logics, and the resulting logic is interpreted in terms of games and uniform ...IF modal logics. Within the ...
34
PP 2009 24: Doing Argumentation Theory in Modal Logic
... Doing argumentation theory `a la Dung means, essentially, to study specific properties of sets of arguments (e.g., conflict-freeness, acceptability, etc.) within a given argumentation framework A . Once an argumentation ...
29
PP 2009 24: Doing Argumentation Theory in Modal Logic
... Modal logic offers a readily available notion of structural equivalence, the notion of bisimulation (with all its variants) [1, 15]. This section sketches the use of bisimulation for argumentation theoretic ...
32
MoL 2011 15: Relation Liftings in Coalgebraic Modal Logic
... for modal logic since Kripke frames and Neighborhood frames can be represented as ...normal modal logics, are coalgebras for the covariant powerset functor P ...classical modal logic, ...
52
PP 2017 23: IPDL: a new modal logic of computation
... neighborhood logic INL with bisimulation safe operations adapted from PDL and dynamic game ...posed modal logic, based on a richer extension of neighborhood semantics which permits both universal and ...
20
Hydra: a Modal Logic Tool for Wordnet Development, Validation and Exploration
... As shown in the present paper, Hydra is an innovative system for managing (development, validation and explo- ration) WordNet database that uses modal logic. Hydra’s development is still in progress. Future ...
6
Philosophical Issues From Kripke's 'Semantical Considerations on Modal Logic'
... such modal idioms could be sufficiently disciplined to be viable, never mind ...a modal logic is not ruled ...a logic for a given modal subject mat- ter is that it should be ...a ...
44
PP 2002 07: Euclidean Hierarchy in Modal Logic
... The paper is organized as follows. §2 has an auxiliary purpose. In it we recall the notion of a topo-bisimulation and an m-topo-bisimulation, and prove some basic facts about topo-bisimulations involving the standard ...
16
PP 2012 19: Structural connections between a forcing class and its modal logic
... the modal logic of forcing, which arises when one considers a model of set theory in the context of all its forcing extensions, interpreting as “in all forcing extensions” and ♦ as “in some forcing ...This ...
23
PP 2007 09: Everything else being equal: A modal logic approach to ceteris paribus preferences
... The basic preference language is nevertheless not sufficient to capture ceteris paribus preferences. We understand ceteris paribus in the strict read- ing of “all other things being equal”, where equal implies an ...
51
PP 2015 24: A Syntactic Proof of Arrow's Theorem in a Modal Logic of Social Choice Functions
... a modal logic, which they call Λ scf [N, X ], to reason about resolute SCF’s (map- ping declared preferences to winners) as well as the agents’ truthful ...This logic can be used to model strate- gic ...
9
PP 2009 34: Rolling down the River: Saul Kripke and the course of modal logic
... Balance’ Modal languages strike a balance between two competing forces: expressive power and computational ...first-order logic itself arose as a reasonably expressive fragment of second-order logic ...
10
MoL 2013 05: On the connection between the categorical and the modal logic approaches to Quantum Mechanics
... and Modal Logic frames, it is natural to ask: can we combine the typing system with the modal logic formalism in order to have a logic for typed processes ? In what follows we propose a ...
102
PP 2016 17: Proving Classical Theorems of Social Choice Theory in Modal Logic
... An obvious yardstick against which to measure different approaches to the for- malisation of social choice frameworks is Arrow’s Theorem [3], the seminal re- sult in the field, which shows that it is impossible to design ...
30
PP 2008 29: Three 13th century views of quantified modal logic
... 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 ...
18