首页> 外文期刊>Electronic Notes in Theoretical Computer Science >Hybrid and Subexponential Linear Logics
【24h】

Hybrid and Subexponential Linear Logics

机译:混合和次指数线性逻辑

获取原文
获取外文期刊封面目录资料

摘要

HyLL (Hybrid Linear Logic) and SELL (Subexponential Linear Logic) are logical frameworks that have been extensively used for specifying systems that exhibit modalities such as temporal or spatial ones. Both frameworks have linear logic (LL) as a common ground and they admit (cut-free) complete focused proof systems. The difference between the two logics relies on the way modalities are handled. In HyLL, truth judgments are labelled by worlds and hybrid connectives relate worlds with formulas. In SELL, the linear logic exponentials (!, ?) are decorated with labels representing locations , and an ordering on such labels defines the provability relation among resources in those locations. It is well known that SELL, as a logical framework, is strictly more expressive than LL. However, so far, it was not clear whether HyLL is more expressive than LL and/or SELL. In this paper, we show an encoding of the HyLL's logical rules into LL with the highest level of adequacy, hence showing that HyLL is as expressive as LL. We also propose an encoding of HyLL into SELL ? (SELL plus quantification over locations) that gives better insights about the meaning of worlds in HyLL. We conclude our expressiveness study by showing that previous attempts of encoding Computational Tree Logic (CTL) operators into HyLL cannot be extended to consider the whole set of temporal connectives. We show that a system of LL with fixed points is indeed needed to faithfully encode the behavior of such temporal operators.
机译:HyLL(混合线性逻辑)和SELL(次指数线性逻辑)是已广泛用于指定表现出时间或空间等模态的系统的逻辑框架。两种框架都有线性逻辑(LL)作为共同点,并且它们都接受(免裁剪)完整的集中证明系统。两种逻辑之间的差异取决于处理方式的方式。在HyLL中,真理判断由世界标记,混合连接词将世界与公式联系起来。在SELL中,线性逻辑指数(!,?)用表示位置的标签装饰,并且对这些标签的排序定义了这些位置中资源之间的可证明性关系。众所周知,SELL作为逻辑框架严格比LL具有更高的表现力。但是,到目前为止,尚不清楚HyLL是否比LL和/或SELL具有更高的表达力。在本文中,我们将HyLL的逻辑规则编码为具有最高水平的LL,从而表明HyLL与LL一样具有表现力。我们还建议将HyLL编码为SELL? (出售以及位置量化)可以更好地了解HyLL中世界的含义。我们通过显示先前的将计算树逻辑(CTL)运算符编码为HyLL的尝试无法扩展为考虑整个时间连接词的集合,来结束我们的表达性研究。我们表明,确实需要具有固定点的LL系统来忠实地编码这种时间算子的行为。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号