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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/08/2019

On Church's Thesis in Cubical Assemblies

We show that Church's thesis, the axiom stating that all functions on th...
research
03/24/2022

Game semantics of universes

This work extends the present author's computational game semantics of M...
research
09/29/2022

Double negation stable h-propositions in cubical sets

We give a construction of classifiers for double negation stable h-propo...
research
05/03/2019

Game Semantics of Martin-Löf Type Theory

We present game semantics of Martin-Löf type theory (MLTT), which solves...
research
03/18/2023

Modelling Chess in VDM++

The game of chess is well-known and widely played all over the world. Ho...
research
05/05/2023

Skolemization in Simple Type Theory: the Logical and the Theoretical Points of View

Peter Andrews has proposed, in 1971, the problem of finding an analog of...
research
09/06/2019

Extracting and Learning a Dependency-Enhanced Type Lexicon for Dutch

This thesis is concerned with type-logical grammars and their practical ...

Please sign up or login with your details

Forgot password? Click here to reset