Sequent Calculi for Normal Update Logics
Sequent Calculi for Normal Update Logics
复制标题
正常更新逻辑的顺序计算
DOI：
10.1007/978-3-662-58771-3_13
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
Katsuhiko Sano and Minghui Ma
中科院分区：
文献类型：
--
作者：
Kyyoul Yun;Masaki Hirano;Shunji Yanase and Yutaka Ohya;Katsuhiko Sano and Minghui Ma
正规更新逻辑是正规条件逻辑的时态化。给出了Andreas Herzig（1998）的最小正规更新逻辑的序列演算及其一些推广.用Takano的语义方法证明了这些演算的子公式性质。从而证明了这类演算的有限模型性质和可判定性。
Normal update logic is the temporalization of normal conditional logic. Sequent calculi for the least normal update logicby Andreas Herzig (1998) and some of its extensions are developed. The subformula property of these sequent calculi is shown by Takano’s semantic method. Consequently we prove the finite model property and decidability of these sequent calculi.