26-28 May 2011, Workshop on Admissible Rules and Unification, Utrecht, The Netherlands

Admissible rules of a logical system are rules that can be added to the system without changing its set of theorems. In algebra, admissible rules correspond to quasi-equations holding in free algebras, while from a computer science perspective, admissibility is intimately related to equational unification.

The aim of this workshop is to bring together experts from these distinct areas of research spanning mathematics, philosophy, and computer science, to share ideas and methods.

For more information, see http://www.phil.uu.nl/~iemhoff/Conferenties/Waru/waru.html.