![]()
一个基于概率区间分裂语言的表列演算
A Tableau Based on a Language of Probability Interval Splitting
摘要:
Intuitionistic Probability Logic ILP, which intended to provide an intuitionistic formalization of reasoning about probability, was proposed by Angelina Ilić-Stepić et al. An objective of this presentation is to introduce a translation from ILP formulas to a new language which is designed to split the occurrence of probability intervals in ILP formulas into a minimum consideration range. Also, I will give a tableau based on the new language.
References
[1] Angelina Ilić-Stepić, Zoran Ognjanović, and Aleksandar Perović. “The Logic ILP for Intuitionistic Reasoning About Probability”. In: Studia Logica (2023), pp. 1–31.![]()
清华大学2022级逻辑学硕士研究生，研究兴趣为时态逻辑、概率逻辑。
时间：2024年11月14日 (周四) 14:00-15:30
地点：清华大学逻辑学研究中心
(蒙民伟人文楼 329)
允许依赖的联盟逻辑：表示定理、有穷模型性与完全性
Coalition Logic Allowing Dependence: Representation Theorem, Finite Model Property, and Completeness
摘要:
Coalition Logic (CL) is a standard and successful logic for reasoning about coalitional power, captured by both effectivity functions from cooperative game theory and (strategic) game forms from non-cooperative game theory, thanks to the representation theorem of truly playable effectivity functions by game forms (see [1]).The axiom of superadditivity in CL precludes dependence between different coalitions’ actions, which is nevertheless ubiquitous. It is natural to ask how to develop a generalization of CL that allows dependence, and can be used to reason about effectivity functions and game forms that allow dependence, which we formulate as dependence-friendlily playable effectivity functions and game forms allowing dependence respectively.In this talk, we will first show our representation theorem of dependence-friendlily playable effectivity functions by game forms allowing dependence. We will then define Coalition Logic Allowing Dependence (CLD), for which we provide a neighbourhood semantics based on effectivity functions and a Kripke semantics based on game forms allowing dependence. We will demonstrate the finite model property of CLD with respect to its neighbourhood models, and in virtue of our representation theorem, prove that CLD is sound and weakly complete with respect to its neighbourhood and Kripke frames.This is joint work with Chenwei Shi.References
[1] Valentin Goranko, Wojciech Jamroga, and Paolo Turrini. Strategic games and truly playable effectivity functions. Autonomous Agents and Multi-Agent Systems, 26:288–314, 2013.
![]()
清华大学2023级逻辑学博士研究生，研究兴趣为逻辑学理论及其在语言学、计算机科学和哲学中的应用，目前主要关注策略推理和形式语义学。个人网页：https://www.weiwang.cool时间：2024年11月14日 (周四) 16:00-17:30
地点：清华大学逻辑学研究中心
(蒙民伟人文楼 329)
![]()
关注我们，及时获取更多关于清华-阿姆斯特丹逻辑学联合研究中心的研究成果、科研教学活动、前沿问题研究进展及其他相关资讯。
