首页> 外文期刊>Studia Logica >inference;;intuitionistic logic;;proof theory;;nature of logic;;logical operators
【24h】

inference;;intuitionistic logic;;proof theory;;nature of logic;;logical operators

机译:推理;直觉逻辑;证明理论;逻辑性质;逻辑运算符

获取原文
获取原文并翻译 | 示例
           

摘要

We study filters in residuated structures that are associated with congruence relations (which we call -filters), and develop a semantical theory for general substructural logics based on the notion of primeness for those filters. We first generalize Stone’s sheaf representation theorem to general substructural logics and then define the primeness of -filters as being “points” (or stalkers) of the space, the spectrum, on which the representing sheaf is defined. Prime FL-filters will turn out to coincide with truth sets under various well known semantics for certain substructural logics. We also investigate which structural rules are needed to interpret each connective in terms of prime -filters in the same way as in Kripke or Routley-Meyer semantics. We may consider that the set of the structural rules that each connective needs in this sense reflects the difficulty of giving the meaning of the connective. A surprising discovery is that connectives , ? of linear logic are linearly ordered in terms of the difficulty in this sense.
机译:我们研究与同余关系相关联的剩余结构中的过滤器(我们称其为-filters),并基于这些过滤器的素数概念开发了通用子结构逻辑的语义理论。首先,我们将斯通的捆表示定理推广为一般的子结构逻辑,然后将-filters的质数定义为空间,即频谱,在频谱上定义了表示捆。对于某些子结构逻辑,素数FL过滤器将与真值集在各种众所周知的语义下一致。我们还研究了以素数过滤器解释每个连接词所需的结构规则,方式与Kripke或Routley-Meyer语义相同。我们可以认为,在这种意义上,每个连接词都需要的一系列结构规则反映了给出连接词含义的困难。一个令人惊讶的发现是,结缔体?从这个意义上讲,线性逻辑的难易程度是线性排序的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号