Verifiers and Generators: Epistemic Semantics for Intuitionistic Logic (Long Version)

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Barenbaum, Pablo
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910223934947328
author Barenbaum, Pablo
author_facet Barenbaum, Pablo
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2605_16157
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Verifiers and Generators: Epistemic Semantics for Intuitionistic Logic (Long Version)
Barenbaum, Pablo
Logic in Computer Science
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.
title Verifiers and Generators: Epistemic Semantics for Intuitionistic Logic (Long Version)
topic Logic in Computer Science
url https://arxiv.org/abs/2605.16157