Verifiers and Generators: Epistemic Semantics for Intuitionistic Logic (Long Version)
Logic in Computer Science
2026-05-18 v1
Abstract
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.
Cite
@article{arxiv.2605.16157,
title = {Verifiers and Generators: Epistemic Semantics for Intuitionistic Logic (Long Version)},
author = {Pablo Barenbaum},
journal= {arXiv preprint arXiv:2605.16157},
year = {2026}
}