Applications of realizability to objects and arithmetic
Realizability is a powerful tool in order to understand the meaning of
mathematical theorems from the point of view of computer science. After
Danos' lectures, we shall apply it to
arithmetical formulas
a trivial logical theorem, which gives insight into object programming
References
"Disjunctive tautologies and synchronisation schemes":
