The object of our study is the propositional linear temporal logic LTL with operations Until
and Next. We deal with inference rules admissible in LTL. Earlier the decidability of LTLw. rt …

While specifications and verifications of concurrent systems employ Linear Temporal Logic
(LTL), it is increasingly likely that logical consequence in LTL will be used in the description …

A projective unifier for a modal formula A, over a modal logic L, is a unifier σ for A (ie a
substitution making A a theorem of L) such that the equivalence of σ with the identity map is …

We investigate logical consequence in temporal logics in terms of logical consecutions, ie,
inference rules. First, we discuss the question: what does it mean for a logical consecution to …

Completeness is one of the most important notions in logic and the foundations of
mathematics. Many variants of the notion have been de? ned in literature. We …

We study an extension ℒƬℒ K of the linear temporal logic ℒƬℒ K by implementing multi-
agent knowledge logic KD45 m (which is often referred as multi-modal logic S5 m). The …

We study projectivity in temporal linear logic LTL with the aim to solve unification problem.
Earlier it was shown that not all formulas unifiable in LTL are projective. Therefore here we …

In terms of formal deductive systems and multi-dimensional Kripke frames we study logical
operations know, informed, common knowledge and common information. Based on [6] we …

The article studies multi-modal (in particular temporal, tense, logics) possessing universal
formulas. We prove (Theorems 11 and 12) that the admissibility problem for inference rules …

As specifications and verifications of concurrent systems employ Linear Temporal Logic
(LTL), it is increasingly likely that logical consequence in LTL will be used in description of …