{"paper":{"title":"Verifiers and Generators: Epistemic Semantics for Intuitionistic Logic (Long Version)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Epistemic realizability interpretations using verifiers and generators are sound and complete for minimal, second-order, and higher-order intuitionistic logic.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Pablo Barenbaum","submitted_at":"2026-05-15T16:38:04Z","abstract_excerpt":"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."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The framework assumes that the property of a datum constituting evidence for a proposition is semi-decidable, which permits the definition of verifier and generator programs that faithfully capture the epistemic content of the logic.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Epistemic realizability assigns verifier and generator programs to propositions and proves soundness and completeness for minimal, second-order, and higher-order intuitionistic logic.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Epistemic realizability interpretations using verifiers and generators are sound and complete for minimal, second-order, and higher-order intuitionistic logic.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8975028fffd4932f907d9132bf80d9ae6fdc5feca9e51629a822c57301c589da"},"source":{"id":"2605.16157","kind":"arxiv","version":1},"verdict":{"id":"2de8b279-a706-4572-8b30-719ebb8b62e6","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T18:42:51.243818Z","strongest_claim":"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.","one_line_summary":"Epistemic realizability assigns verifier and generator programs to propositions and proves soundness and completeness for minimal, second-order, and higher-order intuitionistic logic.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The framework assumes that the property of a datum constituting evidence for a proposition is semi-decidable, which permits the definition of verifier and generator programs that faithfully capture the epistemic content of the logic.","pith_extraction_headline":"Epistemic realizability interpretations using verifiers and generators are sound and complete for minimal, second-order, and higher-order intuitionistic logic."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16157/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T19:01:18.933489Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T18:51:32.550628Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T18:22:02.200807Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:31.039052Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"external_links","ran_at":"2026-05-19T17:31:48.626293Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.440123Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"27cc26ae1808c663269eadceb613743399a30a8f0b5be172d005550d2a073553"},"references":{"count":146,"sample":[{"doi":"","year":2018,"title":"Steve Awodey, Jonas Frey, and Sam Speight. 2018. Impredicative encodings of (higher) inductive types. InProceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. 76–85","work_id":"8a940f2f-578f-4890-892c-cb2731ea4804","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1999,"title":"1999.Term Rewriting and All That","work_id":"47b44c57-5410-42c8-a498-2d2b65b3bd99","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1984,"title":"1984.The Lambda Calculus: Its Syntax and Semantics","work_id":"99b9859e-94cb-4128-9c18-f87f143502b0","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1991,"title":"Henk Barendregt. 1991. Introduction to generalized type systems.Journal of Functional Programming1, 2 (1991), 125–154","work_id":"b047fea2-8c05-419a-b103-b9dbe33661c5","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"2013.Lambda Calculus with Types","work_id":"abfc0a04-44dd-4c15-9ea4-6c2382274643","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":146,"snapshot_sha256":"c28434c17f9d21011e7bb378fa8b605784f00c11f91671722d40cfadc473c0ca","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}