BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//6.4.7.2//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:4292@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20160707T110000
DTEND;TZID=Europe/Paris:20160707T120000
DTSTAMP:20201208T124922Z
URL:https://www.i2m.univ-amu.fr/events/homological-computations-for-term-r
ewriting-systems/
SUMMARY:Homological computations for term rewriting systems - Samuel Mimram
DESCRIPTION:An important problem in universal algebra consists in finding p
resentations of algebraic theories by generators and relations\, which are
as small as possible. Exhibiting lower bounds on the number of those gene
rators and relations for a given theory is a difficult task because it a p
riori requires considering all possible saets of generators for a theory a
nd no general method exists. In this article\, we explain how homological
computations can provide such lower bounds\, in a systematic way\, and sho
w how to actually compute those in the case where a presentation of the th
eory by a convergent rewriting system is known. We also introduce the noti
on of coherent presentation of a theory in order to consider finer homotop
ical invariants. In some aspects\, this work generalizes\, to term rewriti
ng systems\, Squierâ€™s celebrated homological and homotopical invariants
for string rewriting systems.\nThis is joint work with Philippe Malbos.\n\
n\n
ATTACH;FMTTYPE=image/jpeg:https://www.i2m.univ-amu.fr/wp-content/uploads/2
020/01/Samuel_Mimram.jpg
CATEGORIES:SÃ©minaire Logique et Interactions
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20160327T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR