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 prove that a propositional Linear Temporal Logic with Until and Next (LTL) has unitary
unification. Moreover, for every unifiable in LTL formula A there is a most general projective …

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 …

Checking the admissibility of quasiequations in a finitely generated (ie, generated by a finite
set of finite algebras) quasivariety Q amounts to checking validity in a suitable finite free …

Full article: Unification in epistemic logics Skip to Main Content Taylor and Francis Online
homepage Taylor and Francis Online homepage Log in | Register Cart 1.Home 2.All Journals …

We study a temporal logic with non–standard temporal accessibility relations. This logic is
generated by semantic underground models, and any such a model has a base formed by a …

In this article we study and solve some open problem of unification for formulas with
coefficients (meta-variables) in transitive modal logics. The role of coefficients is played by …

The unification problem in a propositional logic is to determine, given a formula F, whether
there exists a substitution s such that s (F) is in that logic. In that case, s is a unifier of F …

The admissible rules of a logic (understood as a structural consequence relation) may be
described as rules that can be added to the logic without producing any new theorems, or …