Modal logics
On the Proof Theory of Indexed Nested Sequents for Classical and Intuitionistic Modal Logics
... intuitionistic modal logics the accurate definition might actually come from structural proof-theoretical studies rather than Hilbert axiomatisations or semantical ...intuitionistic modal ...
30
Remarks about the unification type of several non-symmetric non-transitive modal logics
... problems in the determination of the type of unification with constants and the type of elementary unification in some of the most popular normal modal logics. Acknowledgments We make a point of thanking ...
22
Remarks about the unification type of several non-symmetric non-transitive modal logics
... problems in the determination of the type of unification with constants and the type of elementary unification in some of the most popular normal modal logics. Acknowledgments We make a point of thanking ...
21
About the unification type of modal logics between KB and KTB
... in modal logics, it is known that S5 is unitary [ 1 , Theorem 3], KT is nullary [ 3 , Corollary ...transitive modal logics like K4 and S4 are finitary [ 14 , Theorem ...in modal ...
28
Axiomatizing the lexicographic products of modal logics with linear temporal logic
... products (W 1 ×W 2 , R ′ 1 , . . . , R ′ m , S 1 ′ , . . . , S n ′ ) of C 1 -frames (W 1 , R 1 , . . . , R m ) and C 2 -frames (W 2 , S 1 , . . . , S n ) where (x 1 , x 2 )R ′ i (y 1 , y 2 ) iff x 1 R i y 1 and x 2 = y 2 ...
20
About the unification type of modal logics between KB and KTB
... V (α n ) = {n − 1, n + 1}. Obviously, M, 0 |= ♦ a (( α 0 → α 0 ) ∧ . . . ∧ (α a → α a )). Since F |= L a+1 , therefore L a = L a+1 . Unravelling. In our adaptation to KB, KDB, KTB and L a for each a ∈ N of the ...
27
Modal logics of sabotage revisited
... current modal logics of model change, where we identify the sources of its undecidability in a way that also sheds new light on current dynamic-epistemic ...fixed-point logics of sabotage for analyz- ...
40
Modal Logics for Timed Control
... often called internal in the sense that they refer to the state properties (and clocks) of the system to be controlled. In the case of timed systems they only refer to the untimed sequences of states of the system and ...
25
Unification in epistemic logics
... epistemic logics before entering into the details. Many propositional logics deserve to be called ‘epistemic ...normal modal logics K 45, KD45 and S5 and their multi-agent ...normal ...
16
Two decision problems in Contact Logics
... Contact Logics is the following: the satisfiability problem with respect to the class of all models or with respect to the class of all reflexive and symmetric models is NP-complete (recall that the satisfiability ...
26
Admissibility and unifiability in contact logics
... many modal logics [1–3, 13, 14], but modal logics for which they become undecidable are known ...important modal logics considered in Computer Science and Artificial ...following ...
18
Intuitionistic linear temporal logics
... However, as we will see in Proposition 1, only forward confluence is needed for truth of all formulas to be monotone, even in the presence of ◇, ◻ or even U and R. The frames satisfying this condition are, instead, ...
44
Decidable Logics with Associative Binary Modalities
... of modal logics with an associative binary modality, called counting logics is pro- ...propositional logics allow to express finite cardinalities of sets and more generally to count the number ...
16
Unification in epistemic logics
... The paper is organised as follows. In Sections 2 and 3 , we present the syntax and the semantics of ordinary modal logic. Section 4 is concerned with the computability of the unifiability problem in the normal ...
17
Temporal Logics of Repeating Values
... temporal logics, freeze quantifier, logical methods in program ...real-time logics [Hen90], in hybrid logics [Gor96, ABM01], in modal logics with predicate λ-abstraction [Fit02] and for ...
36
PROBABILISTIC LOGICS BASED ON RIESZ SPACES
... probabilistic logics based on the idea of interpreting formulas as real ...probabilistic logics are not sufficiently expressive to interpret the logic probabilistic CTL and other endogenous probabilistic ...
46
Bisimulations for intuitionistic temporal logics
... including logics with ‘past’ and ‘future’ tenses [ 9 ], or with ‘next’ [ 7 , 19 ] and ‘hence- forth’ [ 17 ...the logics ITL e and ITL p using semantics similar to those of expanding and persistent products ...
18
Algebraic approach to modal extensions of Łukasiewicz logics
... for modal logics, called relational semantics, appeared during the ...of modal logic in the areas of mathematic, computer science, linguistic and ...
119
Indexed Frames and Hybrid Logics
... Some interesting directions for future work include a study of decidability of L(@↓), resolving the conjecture in Remark 4.16, or otherwise providing a more general version of Thm. 2.9. But perhaps the most fruitful ...
21
Book Trafic Modal
... EXCLUSIVITÉ FORBO LA STRUCTURE INNOVANTE À EFFET PLOMBANT L’ACOUSTIQUE 19 dB EN PLUS ! La dalle trafic modal bénéficie d’une structure innovante : l’association de la double armature de ce produit permet ...
7