THE NOVI SAD Seminar

 

PROGRAM

---

Predavanja možete pratiti i online putem MITEAM stranice Novosadskog seminara:
https://miteam.mi.sanu.ac.rs/asset/3iuT7dhKfDxFv5kh3

---

Plan rada Novosadskog seminara za OKTOBAR 2026

---

Četvrtak, 07.10.2026. u 11:00, svečana sala Ogranka SANU u Novom Sadu, Nikole Pašića 6 i Online
Sergei Soloviev, IRIT, Toulouse, France
THE SEMANTIC GAMES WITH RESTRICTIONS ON COMPUTATIONAL COMPLEXITY OF STRATEGIES
Several authors (Coquand, Bonnay, Krivine, Boyer and Sandu...) proposed to consider semantic games with backward moves in Game Theoretical Semantics with computable strategies, one of main motivations being that games with backward moves better reflect provability (the winning strategies for Verifier may be obtained from proofs in classical logic). However, this introduces an important asymmetry: only Verifier has the right to replay. We add another asymmetry, the difference in computational power between Verifier and Falsifier. It is shown that in certain situations the semantics may be "perverted", e.g., Verifier may win for a false formula. We obtain some sufficient conditions for such a case, and provide several examples when the strategies of Falsifier are limited to primitive recursive or to provably general recursive functions (based on Generalized Ramsey's Theorem). The importance of this when proof more and more often is replaced by computer based computations, especially provided by AI-agents, is discussed.

---