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

Speaker(s)

Aleksy Schubert

Affiliation

MIMUW

Language of the talk

English

Date

Oct. 18, 2024, 12:15 p.m.

Room

room 5450

Title in Polish

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

Seminar

Seminar Semantics, Logic, Verification and its Applications

---

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.

 

---