...
首页> 外文期刊>Theory of computing systems >Feasible Operations on Proofs: The Logic of Proofs for Bounded Arithmetic
【24h】

Feasible Operations on Proofs: The Logic of Proofs for Bounded Arithmetic

机译:证明的可行运算:有界算术的证明逻辑

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

摘要

This paper presents a semantics for the logic of proofs LP in which all the operations on proofs are realized by feasibly computable functions. More precisely, we will show that the completeness of LP for the semantics of proofs of Peano Arithmetic extends to the semantics of proofs in Buss' bounded arithmetic S_2~1. In view of applications in epistemology of LP in particular and justification logics in general this result shows that explicit knowledge in the propositional framework can be made computationally feasible.
机译:本文提出了证明逻辑LP的语义,其中对证明的所有操作均通过可行的可计算功能实现。更准确地说,我们将证明LP对Peano算法的证明语义的完整性扩展到Buss有界算术S_2〜1中的证明语义。鉴于特别是在LP认识论中的应用,以及一般而言,证明逻辑在应用中,该结果表明,命题框架中的显式知识可以在计算上变得可行。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号