Decidability: theorems and admissible rules

Journal of Applied Non-Classical Logics 18 (2-3):293-308 (2008)
  Copy   BIBTEX


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.



    Upload a copy of this work     Papers currently archived: 86,377

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On the rules of intermediate logics.Rosalie Iemhoff - 2006 - Archive for Mathematical Logic 45 (5):581-599.
Intermediate Logics and Visser's Rules.Rosalie Iemhoff - 2005 - Notre Dame Journal of Formal Logic 46 (1):65-81.
Rules and Arithmetics.Albert Visser - 1999 - Notre Dame Journal of Formal Logic 40 (1):116-140.
Rules in relevant logic - I: Semantic classification.Ross T. Brady - 1994 - Journal of Philosophical Logic 23 (2):111 - 137.
HC of an admissible set.Sy D. Friedman - 1979 - Journal of Symbolic Logic 44 (1):95-102.


Added to PP

19 (#654,308)

6 months
2 (#520,889)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Dynamic Modalities.Dimiter Vakarelov - 2012 - Studia Logica 100 (1-2):385-397.

Add more citations