Game semantics of Martin-L\"of type theory, part III: its consistency with Church's thesis
Norihiro Yamada

TL;DR
This paper establishes the consistency of intensional Martin-Löf type theory with Church's thesis using a novel game semantics approach, addressing longstanding challenges in formal verification.
Contribution
It introduces a new realizability method based on game semantics to prove the consistency of MLTT with Church's thesis, overcoming previous limitations.
Findings
Proves consistency of MLTT with Church's thesis
Develops a novel game semantics-based realizability method
Addresses limitations of traditional realizability approaches
Abstract
We prove consistency of intensional Martin-L\"of type theory (MLTT) with formal Church's thesis (CT), which was open for at least fifteen years. The difficulty in proving the consistency is that a standard method of realizability \`{a} la Kleene does not work for the consistency, though it validates CT, as it does not model MLTT; specifically, the realizability does not validate MLTT's congruence rule on pi-types (known as the -rule). We overcome this point and prove the consistency by novel realizability \`{a} la game semantics, which is based on the author's previous work.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Logic, Reasoning, and Knowledge · Advanced Database Systems and Queries
