Complete Axiomatizations for Reasoning about Knowledge and Time
Top Cited Papers
- 1 January 2004
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 33 (3) , 674-703
- https://doi.org/10.1137/s0097539797320906
Abstract
Sound and complete axiomatizations are provided for a number of different logics involving modalities for knowledge and time. These logics arise from different choices for various parameters regarding the interaction of knowledge with time and regarding the language used. All the logics considered involve the discrete time linear temporal logic operators "next" and "until" and an operator for the knowledge of each of a number of agents. Both the single-agent and multiple-agent cases are studied: in some instances of the latter there is also an operator for the common knowledge of the group of all agents. Four different semantic properties of agents are considered: whether they (i) have a unique initial state, (ii) operate synchronously, (iii) have perfect recall, and (iv) learn. The property of no learning is essentially dual to perfect recall. Not all settings of these parameters lead to recursively axiomatizable logics, but sound and complete axiomatizations are presented for all the ones that do.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Reasoning About KnowledgePublished by MIT Press ,1995
- A guide to completeness and complexity for modal logics of knowledge and beliefArtificial Intelligence, 1992
- A model-theoretic analysis of knowledgeJournal of the ACM, 1991
- The complexity of reasoning about knowledge and time. I. Lower boundsJournal of Computer and System Sciences, 1989
- An elementary proof of the completeness of PDLTheoretical Computer Science, 1981
- A Study of Kripke-type Models for Some Modal Logics by Gentzen's Sequential MethodPublications of the Research Institute for Mathematical Sciences, 1977