跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.25799 · v1

Computational trust as intuitionistic knowledge

首次提交 2026-11-19 17:24
版本更新 2026-11-19 17:24
雷达观测 2026-11-20 19:58
arXiv ↗PDF ↗

摘要

In this paper, we will argue that the notion of computational trust can be understood as a form of fallible intuitionistic knowledge grounded in verification. This approach naturally captures a key aspect of trust: it involves vulnerability. Specifically, it validates the principle that verification leads to trust but does not validate the opposite principle that trust leads to verification. Thus, we can trust on good grounds that some program will perform according to its specification but the program might still fail. We present a simple logic for capturing this notion of computational trust based on constructive modal propositional logic extended with a trust modality, which will be specified in an inferential fashion and by utilizing the proofs-as-programs correspondence.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-19 17:24 · 最新观测版本

Computational trust as intuitionistic knowledge

In this paper, we will argue that the notion of computational trust can be understood as a form of fallible intuitionistic knowledge grounded in verification. This approach naturally captures a key aspect of trust: it involves vulnerability. Specifically, it validates the principle that verification leads to trust but does not validate the opposite principle that trust leads to verification. Thus, we can trust on good grounds that some program will perform according to its specification but the program might still fail. We present a simple logic for capturing this notion of computational trust based on constructive modal propositional logic extended with a trust modality, which will be specified in an inferential fashion and by utilizing the proofs-as-programs correspondence.

查看此版本解读 →查看此版本原文 ↗