首页> 美国政府科技报告 >Sequent Calculi for Normal Modal Propositional Logics
【24h】

Sequent Calculi for Normal Modal Propositional Logics

机译:正态模态命题逻辑的后续计算

获取原文

摘要

A systematic sequent style proof theory for many important systems of normalmodal propositional logic based on Classical Propositional Logic (CPL) is presented. Philosophical, methodological, and computational aspects of the problem of Gentzenizing modal logic are discussed and a variant of Belnap's Display Logic is introduced. Within this proof theory, the modal axiom schemes D, T, 4, 5, and B (and some others) can be captured by characteristic structural inference rules. It is shown that for all sequent systems under consideration: cut is admissible; the subformula property holds; and all connectives are uniquely characterized. Modal systems based on substructural subsystems of CPL are also addressed.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号