Title: Logic for computation: an introduction to computability logic

Speaker:  Yiting Wang (PKU)

Time: 15:10 ~ 18:00  (Sept. 20)

Location: Room 404, No.3 Teaching Building

Abstract:  It is well known that intuitionistic logic has a strong connection to computer science in many syntactic approaches. However, when we apply semantic interpretation of intuitionistic logic (such as BHK interpretation) to computational problems, lots of philological and technical troubles will immediately arise. In this talk, we will  point out some of  these troubles after reviewing some implements of BHK interpretation. And then we will focus on so-called "computability logic'' first introduced by Japaridze. By viewing computational problems as games, computability logic  proposes a semantic approach to capture the notion of computability by an extension of intuitionistic logic. With its rather strong expressive power, computability logic also provides us a computational "context'' to compare the notion of "truth'' in classical logic and intuitionistic logic.

References:

Japaridze, Giorgi (2003). “Introduction to Computability Logic”. In: Annals of Pure and AppliedLogic 123.1, pp. 1–99.

Japaridze, Giorgi (2009). “In the Beginning Was Game Semantics?” In: Games: Unifying Logic, Language, and Philosophy.Ed. by Ondrej Majer, Ahti-Veikko Pietarinen, and Tero Tulenheimo. Vol. 15. Dordrecht: SpringerNetherlands, pp. 249–350.