BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/current/newsitem/14310
/27-June-2023-NihiL-Seminar-Aleksi-Anttila-Søren-K
nudstorp
DTSTAMP:20230622T182829
SUMMARY:NihiL Seminar, Aleksi Anttila & Søren Knud
storp
ATTENDEE;ROLE=Speaker:Aleksi Anttila & Søren Knuds
torp
DTSTART;TZID=Europe/Amsterdam:20230627T160000
DTEND;TZID=Europe/Amsterdam:20230627T173000
LOCATION:ILLC seminar room F1.15, Science Park 107
, Amsterdam / online via Zoom
DESCRIPTION:Abstract:. Within team semantics, a f
ocal point of study has been that of expressive po
wer (what properties can a given logic express). O
ne such team logic is BSML, a modal team logic des
igned for modeling free choice inferences and rela
ted linguistic phenomena. In recent work, Aloni e
t al. (2023) present two extensions of BSML, demon
strating their expressive completeness for all pro
perties [invariant under bounded bisimulation] and
all union-closed properties, respectively, and le
ave open the problem of characterizing the express
ive power of BSML. Continuing this line of work, w
e solve this problem by showing that BSML is expre
ssively complete for all convex, union-closed prop
erties. This leads us to ponder a logic that is ex
pressively complete for all convex properties simp
liciter. We introduce a logic which accomplishes p
recisely that.
X-ALT-DESC;FMTTYPE=text/html:\n #### Abstract:

\n Within team semantics, a focal point of st
udy has been that of expressive power (what proper
ties can a given logic express). One such team log
ic is BSML, a modal team logic designed for modeli
ng free choice inferences and related linguistic p
henomena.

\n In recent work, Aloni et al. (
2023) present two extensions of BSML, demonstratin
g their expressive completeness for all properties
[invariant under bounded bisimulation] and all un
ion-closed properties, respectively, and leave ope
n the problem of characterizing the expressive pow
er of BSML. Continuing this line of work, we solve
this problem by showing that BSML is expressively
complete for all convex, union-closed properties.
This leads us to ponder a logic that is expressiv
ely complete for all convex properties simpliciter
. We introduce a logic which accomplishes precisel
y that.

URL:https://projects.illc.uva.nl/nihil/seminar
CONTACT:Søren Brinck Knudstorp at s.b.knudstorp at
uva.nl
END:VEVENT
END:VCALENDAR