A sequent calculus for propositional dynamic logic for agents with interactions

被引：0
|
作者：
Sakalauskaite J. [1 ]
机构：
[1] Institute of Mathematics and Informatics, LT-08663 Vilnius
来源：
Lithuanian Mathematical Journal | 2005年 / 45卷 / 2期
关键词：
Agents; Commitment; Completeness; Cut rule; Dynamic logic; Interaction; Knowledge; Sequent calculus; Soundness; Wishes;
D O I：
10.1007/s10986-005-0025-4
中图分类号：
学科分类号：
摘要：
We consider a propositional dynamic logic for agents with interactions such as known commitment, no learning, and perfect recall. For this logic, we present a sequent calculus with a restricted cut rule and prove the soundness and completeness for the calculus. © 2005 Springer Science+Business Media, Inc.
引用
收藏
页码：217 / 224
页数：7
相关论文
共 50 条
12345