This paper explores epistemic realizability, a form of realizability in which the property that a piece of data constitutes evidence for a logical proposition is semi-decidable. In this framework, each proposition A is assigned a verifier} program that checks whether a datum X is a realizer for A, and a dual generator program that behaves as a generic realizer for X. We propose epistemic realizability interpretations for minimal logic, second-order intuitionistic logic, and higher-order intuitionistic logic, proving that each system is sound and complete under the proposed semantics.

翻译：本文探讨了认知可实现性——一种可实现性形式，其中数据作为逻辑命题证据的性质是半可判定的。在此框架下，每个命题A被赋予一个验证器程序，用于检查数据X是否为A的实现者，同时还有一个对偶的生成器程序，其行为类似于X的泛型实现者。我们为极小逻辑、二阶直觉主义逻辑和高阶直觉主义逻辑提出了认知可实现性解释，并证明了各系统在提出的语义下具有可靠性和完备性。