Temporal logic with interacting agents

The paper deals with a temporal multi-agent logic T MAZ , which imitates taking of decisions based on agents' access to knowledge by their interaction. The interaction is modeled by possible communication channels between agents in special temporal Kripke/Hintikka-like models. The logic T MAZ distinguishes local and global decisions-making. T MAZ is based on temporal Kripke/Hintikka models with agents' accessibility relations defined on states of all possible time clusters C(i) (where indexes i range over all integer numbers Z). The main result provides a decision algorithm for T MAZ (so, we prove that T MAZ is decidable). This algorithm also solves the satisfiability problem. In the final part of the paper, we consider the admissibility problem for inference rules in T MAZ , and show that this problem is decidable for T MAZ as well