BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UNIFR/WEBMASTER//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTSTART;VALUE=DATE:20101214T171500
DTEND;VALUE=DATE:20101214T171500
UID:5622@agenda.unifr.ch
DESCRIPTION:Unification involves the search for substitutions that make two terms ""equal"". In syntactic unification, the substitution should make the terms identical; in semantic unification, they should be made equal with respect to some equational theory (e.g., equal in all groups or semigroups). This latter task amounts to solving equations in free algebras of the given theory. On the other hand, solving quasi-equations in these free algebras corresponds to\nthe problem of determining the admissibility of rules for particular logics or\nclasses of algebras.\nThis talk will first introduce some of the core ideas and achievements\nof research into semantic unification and then explain their relevance for\ncharacterizing and exploiting admissible rules.<br />\n[Invited by L. Ciobanu]
SUMMARY:Prof. Dr. George METCALFE (Universität Bern): Unification and Admissibility
CATEGORIES:Colloque / Congrès / Forum
LOCATION:PER 08\, Phys 2.52\, Chemin du Musée 3\, 1700 Fribourg
URL;VALUE=URI:https://agenda.unifr.ch/e/fr/5622
END:VEVENT
END:VCALENDAR