首页> 外文会议>International symposium on logical foundations of computer science >Multiple Conclusion Linear Logic: Cut Elimination and More
【24h】

Multiple Conclusion Linear Logic: Cut Elimination and More

机译:多个结论线性逻辑:消除消极等

获取原文

摘要

Full Intuitionistic Linear Logic (FILL) was first introduced by Hyland and de Paiva, and went against current beliefs that it was not possible to incorporate all of the linear connectives, e.g. tensor, par, and implication, into an intuitionistic linear logic. It was shown that their formalization of FILL did not enjoy cut-elimination by Bierman, but Bellin proposed a change to the definition of FILL in the hope to regain cut-elimination. In this note we adopt Bellin's proposed change and give a direct proof of cut-elimination. Then we show that a categorical model of FILL in the basic dialectica category is also a LNL model of Benton and a full tensor model of Mellies' and Tabareau's tensorial logic. Lastly, we give a double-negation translation of linear logic into FILL that explicitly uses par in addition to tensor.
机译:完全直觉线性逻辑(FILL)最早是由Hyland和de Paiva提出的,并且与当前的观点相抵触,即不可能将所有线性连接词(例如,将张量,参数和蕴涵转换为直觉的线性逻辑。结果表明,比尔曼没有正式取消FILL的定义,但是贝林建议更改FILL的定义,以期重新获得淘汰。在本说明中,我们采用贝林提议的更改,并给出了消除切割的直接证据。然后,我们证明基本方言分类中的FILL的分类模型也是Benton的LNL模型以及Mellies和Tabareau的张量逻辑的完整张量模型。最后,我们给出了线性逻辑到FILL的双重否定转换,该函数显式使用张量之外的par。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号