Satisfiability in a temporal multi-valueted logic based on $\mathbb{Z}$

In this paper we continue the series of papers by V. V. Rybakov devoted to properties of multi-valueted logics and where he propose a new approach for modelling knowledge and reasoning of agents in a multi-agent system. We prove that the satisfiability problem is decidable in a temporal multi-valueted logic based on $\mathbb{Z}$.