• Corpus ID: 220546221

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

  title={Game semantics of Martin-L{\"o}f type theory, part III: its consistency with Church's thesis},
  author={Norihiro Yamada},
We prove consistency of intensional Martin-Lof 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 $\xi$-rule). We overcome this point and prove the consistency by novel… 
Parametric Church's Thesis: Synthetic Computability Without Choice
This work introduces various parametric strengthenings of CTφ, which are equivalent to assuming CT φ and an S n operator for φ like in the S n theorem, and explains the novel axioms and proofs of Rice’s theorem.


Consistency of the intensional level of the Minimalist Foundation with Church’s thesis and axiom of choice
It is shown that consistency with the formal Church’s thesis and the axiom of choice are satisfied by the intensional level of the two-level Minimalist Foundation, for short MF, completed in 2009 by the second author.
Game Semantics for Martin-Löf Type Theory
A category with families of a novel variant of games is proposed, which induces a surjective and injective interpretation of the intensional variant of MLTT equipped with unit-, empty-, N-, dependent product, dependent sum and Id-types as well as the cumulative hierarchy of universes for the first time in the literature.
A game-semantic model of computation
This work shows, as a main technical achievement, that viable strategies in game semantics are Turing complete and has given a mathematical foundation of computation in the same sense as Turing machines but beyond computation on natural numbers, e.g., higher-order computation, in a more abstract fashion.
Notes on game semantics
Applications of game semantics to model-checking and abstract interpretation are being developed, which opens the way for connecting the uses of games in semantics and in verification.
Definability and Full Abstraction
  • P. Curien
  • Computer Science
    Electron. Notes Theor. Comput. Sci.
  • 2007
A game semantics for generic polymorphism
Realizability Models for Type Theories
Intensionality, Definability and Computation
  • S. Abramsky
  • Computer Science
    Johan van Benthem on Logic and Information Dynamics
  • 2014
This work reviews how game semantics has been used to characterize the sequential functional processes, leading to powerful and flexible methods for constructing fully abstract models of programming languages, with applications in program analysis and verification.
Games for Dependent Types
Although definability for the hierarchy with $$\mathsf {Id}$$-types remains to be investigated, the notions of propositional equality in syntax and semantics do coincide for open terms of the type hierarchy.
Church's Thesis: A Kind of Reducibility Axiom for Constructive Mathematics