*Popis:* | 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. Previous editions of the workshop were held in Utrecht (2011), and in Les Diablerets (2015). Everybody is welcome to attend the workshop. Giving a talk and attending the conference dinner is by invitation only. |