【24h】

Analytic Calculi for Monadic PNmatrices

机译:一元PN矩阵的解析计算

获取原文

摘要

Analytic calculi are a valuable tool for a logic, as they allow for effective proof-search and decidability results. We study the axiomatization of generalized consequence relations determined by monadic partial non-deterministic matrices (PNmatrices). We show that simple axiomatizations can always be obtained, using inference rules which can have more than one conclusion. Further, we prove that these axiomatizations are always analytic, which seems to raise a contrast with recent non-analyticity results for sequent-calculi with PNmatrix semantics.
机译:分析演算是进行逻辑分析的宝贵工具,因为它们可以提供有效的证明搜索和可判定性结果。我们研究由单子部分非确定性矩阵(PNmatrices)确定的广义结果关系的公理化。我们证明,使用推理规则可以总是获得简单的公理化,该推理规则可以有多个结论。此外,我们证明了这些公理化始终是分析性的,这似乎与具有PNmatrix语义的后续计算的近期非分析性结果形成了对比。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号