A Probabilistic Temporal Epistemic Logic: Strong Completeness

被引：4
|
作者：
Ognjanovic, Zoran [1 ]
Stepic, Angelina Ilic [1 ]
Perovic, Aleksandar [2 ]
机构：
[1] Serbian Acad Arts & Sci, Math Inst, Belgrade 11000, Serbia
[2] Univ Belgrade, Fac Transport & Traff Engn, Belgrade 11000, Serbia
来源：
LOGIC JOURNAL OF THE IGPL | 2024年 / 32卷 / 01期
关键词：
DECIDABILITY; KNOWLEDGE;
D O I：
10.1093/jigpal/jzac072
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The paper offers a formalization of reasoning about distributed multi-agent systems. The presented propositional probabilistic temporal epistemic logic PTEL is developed in full detail: syntax, semantics, soundness and strong completeness theorems. As an example, we prove consistency of the blockchain protocol with respect to the given set of axioms expressed in the formal language of the logic. We explain how to extend PTEL to axiomatize the corresponding first-order logic.
引用
收藏
页码：94 / 138
页数：45
相关论文
共 50 条
12345