Мульти-агентные логики с взаимодействием, унифицируемость и проективность

This paper works with multi-agent none-classical modal logics generated by relational Kripke-like models describing transfer information and its' reliability. We suggest Kripke-like models essentially extending usual multi-modal Kripke semantics. We primarily study algorithmic problems connected with such logics. We find a proof that such logics are decidable, finding algorithms verifying satisfiability formulas, we also solve the problem of admissibility inference rules via technique of projective formulas and unification, we prove that this problem is decidable in such logics.