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:7765@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20160707T110000
DTEND;TZID=Europe/Paris:20160707T120000
DTSTAMP:20241120T204824Z
URL:https://www.i2m.univ-amu.fr/evenements/homological-computations-for-te
 rm-rewriting-systems/
SUMMARY:Samuel Mimram (LIX\, Polytechnique Palaiseau): Homological computat
 ions for term rewriting systems
DESCRIPTION:Samuel Mimram: An important problem in universal algebra consis
 ts in finding presentations of algebraic theories by generators and relati
 ons\, which are as small as possible. Exhibiting lower bounds on the numbe
 r of those generators and relations for a given theory is a difficult task
  because it a priori requires considering all possible saets of generators
  for a theory and no general method exists. In this article\, we explain h
 ow homological computations can provide such lower bounds\, in a systemati
 c way\, and show how to actually compute those in the case where a present
 ation of the theory by a convergent rewriting system is known. We also int
 roduce the notion of coherent presentation of a theory in order to conside
 r finer homotopical invariants. In some aspects\, this work generalizes\, 
 to term rewriting systems\, Squier’s celebrated homological and homotopi
 cal invariants for string rewriting systems.\nThis is joint work with Phil
 ippe 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