首页> 外文会议>IFIP TC 1/WG 2.2 international conference on theoretical computer science >From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic
【24h】

From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic

机译:从显示演算到深度嵌套继发演算:完全直觉线性逻辑的形式化

获取原文

摘要

Proof theory for a logic with categorical semantics can be developed by the following methodology: define a sound and complete display calculus for an extension of the logic with additional adjunctions; translate this calculus to a shallow inference nested sequent calculus; translate this calculus to a deep inference nested sequent calculus; then prove this final calculus is sound with respect to the original logic. This complex chain of translations between the different calculi require proofs that are technically intricate and involve a large number of cases, and hence are ideal candidates for formalisation. We present a formalisation of this methodology in the case of Pull Intuitionistic Linear Logic (PILL), which is multiplicative intuitionistic linear logic extended with par.
机译:可以通过以下方法来开发具有分类语义的逻辑的证明理论:为附加的逻辑扩展逻辑定义完善的显示演算;将该演算转换为浅层推理嵌套的后续演算;将这个演算转换为嵌套的后续演算的深层推断;然后证明最后的演算相对于原始逻辑是合理的。不同结石之间这种复杂的翻译链需要证明,这些证明在技术上是复杂的,涉及大量案例,因此是形式化的理想候选者。在拉直觉线性逻辑(PILL)的情况下,我们提出了这种方法的形式化形式,它是使用par扩展的可乘直觉线性逻辑。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号