Unification was originally introduced in automated deduction and term rewriting, but has
recently also found applications in other fields. In this article, we give a survey of the results …

We construct explicit bases of admissible rules for a representative class of normal modal
logics (including the systems K4, GL, S4, Grz, and GL. 3), by extending the methods of S …

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 …

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 …

Independent bases of admissible rules Page 1 Independent bases of admissible rules Emil
Jerábek∗ Institute of Mathematics of the Academy of Sciences Zitná 25, 115 67 Praha 1, Czech …

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 unification problem and problem of admissibility for inference rules in minimal
Johanssonsʼ logic J and positive intuitionistic logic IPC+. This paper proves that the …

The problem of unification in a normal modal logic can be defined as follows: given a
formula, determine whether there exists a substitution such that is in. In this paper, we prove …

Full article: KD is nullary Skip to Main Content Taylor and Francis Online homepage Taylor and
Francis Online homepage Log in | Register Cart 1.Home 2.All Journals 3.Journal of Applied …