Game semantics of Martin-Löf type theory, part III: its consistency with Church's thesis

07/16/2020 ∙ by Norihiro Yamada, et al. ∙ 0

We prove consistency of intensional Martin-Löf 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 à 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 à la game semantics, which is based on the author's previous work.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.