Stirling games in the proof of the higher-order matching problem decidability

Prelegent(ci)

Aleksy Schubert

Afiliacja

MIMUW

Język referatu

angielski

Termin

18 października 2024 12:15

Pokój

p. 5450

Tytuł w języku polskim

Gry Stirlinga w dowodzie rozstrzygalności problemu dopasowania wyższego rzędu

Seminarium

Semantyka, Logika I Weryfikacja Oraz Wiele Ich Ciekawych Aplikacji

---

The initial part of the Stirling's proof that the higher order matching problem
is decidable is devoted to the notion of specific game. This game approach is
simply a framework in which a reduction machine is described. In order to understand
the Stirling's proof one has to clearly understand the regularities that occur in this
(or any other) reduction. This is spelled out in terms of a series of notions
that will be presented during the talk.

 

---