BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Elaine Pimentel (DMAT/UFRN)
DTSTART:20200618T180000Z
DTEND:20200618T190000Z
DTSTAMP:20260423T035747Z
UID:OLS/12
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OLS/12/">A g
 ame model for proofs with costs</a>\nby Elaine Pimentel (DMAT/UFRN) as par
 t of Online logic seminar\n\n\nAbstract\nWe look at substructural calculi 
 from a game semantic point of view\, guided by certain intuitions about re
 source conscious and\, more specifically\, cost conscious reasoning. To th
 is aim\, we start with a game\, where player I defends a claim correspondi
 ng to a (single-conclusion) sequent\, while player II tries to refute that
  claim. Branching rules for additive connectives are modeled by choices of
  II\, while branching for multiplicative connectives leads to splitting th
 e game into parallel subgames\, all of which have to be won by player I to
  succeed. The game comes into full swing by adding cost labels to assumpti
 ons\, and a corresponding budget. Different proofs of the same end-sequent
  are interpreted as more or less expensive strategies for \\I to defend th
 e corresponding claim. This leads to a new kind of labelled calculus\, whi
 ch can be seen as a fragment of SELL (subexponential linear logic).  Final
 ly\, we generalize the concept of costs in proofs by using a semiring stru
 cture\, illustrate our interpretation by examples and investigate some pro
 of-theoretical properties.\nThis is a joint work with Timo Lang\, Carlos O
 larte and Christian G. Fermüller\n
LOCATION:https://researchseminars.org/talk/OLS/12/
END:VEVENT
END:VCALENDAR