e-space
Manchester Metropolitan University's Research Repository

    Decidability: theorems and admissible rules

    Rybakov, Vladimir V. (2008) Decidability: theorems and admissible rules. Journal of Applied Non-Classical Logics, 18 (2-3). pp. 293-308. ISSN 1958-5780

    File not available for download.

    Abstract

    The paper deals with a temporal multi-agent logic TMAZ, which imitates taking of decisions based on agents' access to knowledge by their interaction. The interaction is modelled by possible communication channels between agents in special temporal Kripke/Hintikka-like models. The logic TMAZ distinguishes local and global decisions-making. TMAZ 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 TMAZ (so, we prove that TMAZ 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 TMAZ, and show that this problem is decidable for TMAZ as well.

    Impact and Reach

    Statistics

    Activity Overview
    6 month trend
    0Downloads
    6 month trend
    275Hits

    Additional statistics for this dataset are available via IRStats2.

    Altmetric

    Repository staff only

    Edit record Edit record