BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:8024@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20150702T110000
DTEND;TZID=Europe/Paris:20150702T120000
DTSTAMP:20241120T205629Z
URL:https://www.i2m.univ-amu.fr/evenements/realizability-games-for-the-spe
 cification-problem/
SUMMARY:Etienne Miquey (PPS\, Université Paris-Diderot): Realizability gam
 es for the specification problem
DESCRIPTION:Etienne Miquey: In Krivine classical realizability\, one can un
 derstand the truth value of a formula (that is the set of its realizers) a
 s its defenders\, and the falsity value as the set of its opponents. Follo
 wing this intuition\, the execution of a process is a match between both p
 layers\, that a realizer should win.\n-\nIn this talk\, we will explain ho
 w to use a notion of game to give a precise specification of the realizers
  of a given formula. We will focus on the particular case of arithmetical 
 formulae\, for which our definition relies on the principle of Coquand's g
 ames. In the end\, we obtain an equivalence between universal realizers an
 d winning strategies (even in presence of non-substitutive instructions su
 ch as Quote)\, which also directly implies the absoluteness of arithmetica
 l formulae for classical realizability.\n-\nhttp://www.pps.univ-paris-dide
 rot.fr/~emiquey/
ATTACH;FMTTYPE=image/jpeg:https://www.i2m.univ-amu.fr/wp-content/uploads/2
 015/07/Etienne_Miquey.jpg
CATEGORIES:Séminaire,Logique et Interactions
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20150329T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR