Studia Logica

, Volume 75, Issue 1, pp 93–123

Complete Axiomatizations for Reasoning about Knowledge and Branching Time

  • Ron van der Meyden
  • Ka-shu Wong

DOI: 10.1023/A:1026181001368

Cite this article as:
van der Meyden, R. & Wong, K. Studia Logica (2003) 75: 93. doi:10.1023/A:1026181001368


Sound and complete axiomatizations are provided for a number of different logics involving modalities for the knowledge of multiple agents and operators for branching time, extending previous work of Halpern, van der Meyden and Vardi [to appear, SIAM Journal on Computing] for logics of knowledge and linear time. The paper considers the system constraints of synchrony, perfect recall and unique initial states, which give rise to interaction axioms. The language is based on the temporal logic CTL*, interpreted with respect to a version of the bundle semantics.

modal logicepistemic logiclogic of knowledgetemporal logicbranching timemulti-agent systemsperfect recallsynchrony

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Ron van der Meyden
    • 1
  • Ka-shu Wong
    • 1
  1. 1.School of Computer Science and EngineeringUniversity of New South WalesSydneyAustralia