Temporal multi-agent logics, problems satisfiability, decidability and admissibility

In our research we investigate temporal multi-agent logics with various possible non-transitive temporal accessibility relations. Main idea of this choice consists in attempts more precisely model and describe behavior, reasoning and computation agents (distinct acting computational threads) when they cooperate and acts mutually. In particular, we consider non-transitive logics, where elements of interval logics are applied. In this case the time accessibility relations are non-transitive and chopped into intervals of bounded time. In definition of models, we consider logics with only one objective valuation of propositional states and logics with multi-valuations — the case when the agents have separated own valuations' relations for propositions.
Looking at the case when the time accessibility relations may be affected by events and alter during computation we study logics which have dynamic accessibility relations — the case when any state (world) generates (and hence have) its own accessibility relation. Mathematical problems we are dealing with are problems of satisfiability, decidability and admissibility. Found computational algorithms to be reported.
Supported by the Krasnoyarsk Mathematical Center and financed by the Ministry of Science and Higher Education of the Russian Federation (Grant No. 075-02-2020-1534/1) and by Research Program at the National Research University Higher School of Economics (HSE University) Moscow.