Projective formulas and unification in linear discrete temporal multi-agent logics

This article continues our studying the problem of unification in multi-agent logics. Based on the approach to the unificational problem through the projective formulas proposed by V. Rybakov and S. Ghilardi, in this paper we consider some linear discrete temporal logics with the agent relations. We proved the projectivity of any unifiable formula in these logics and gave an algorithm for construction the most general unifier.