【24h】

Sequentialising Nested Systems

机译:序列化嵌套系统

获取原文

摘要

In this work, we investigate the proof theoretic connections between sequent and nested proof calculi. Specifically, we identify general conditions under which a nested calculus can be transformed into a sequent calculus by restructuring the nested sequent derivation (proof) and shedding extraneous information to obtain a derivation of the same formula in the sequent calculus. These results are formulated generally so that they apply to calculi for intuitionistic, normal modal logics and negative modalities.
机译:在这项工作中,我们研究了顺序证明和嵌套证明计算之间的证明理论联系。具体而言,我们确定了一般的条件,在这些条件下,嵌套的演算可以通过重构嵌套的顺序推导(证明)并舍弃无关的信息来获得顺序演算中相同公式的推导,从而将其转换为顺序演算。一般将这些结果表述为使得它们适用于直觉,正常模态逻辑和否定模态的计算。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号