Epistemic realizability assigns verifier and generator programs to propositions and proves soundness and completeness for minimal, second-order, and higher-order intuitionistic logic.
First note that ๐ ฮ โ๐ค ๐ ฮ is also a root reduc- tion step by Thm
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Verifiers and Generators: Epistemic Semantics for Intuitionistic Logic (Long Version)
Epistemic realizability assigns verifier and generator programs to propositions and proves soundness and completeness for minimal, second-order, and higher-order intuitionistic logic.