Bilattices: an algebraic (logic) perspective

Add to your list(s) Download to your calendar using vCal

• Umberto Rivieccio, University of Genoa
• Friday 02 July 2010, 14:00-15:00
• UG40 Computer Science.

If you have a question about this talk, please contact Paul Levy.

We present some algebraic results on several varieties of algebras having a bilattice reduct. Some of these algebras have already been studied in the literature, while others arose from our algebraic logic study of the bilattice-based logics introduced by O. Arieli and A. Avron. We extend the representation theorem for bounded interlaced bilattices to the unbounded case and we prove analogous representation theorems for the other classes of bilattices considered. We use these results to establish categorical equivalences between these structures and well-known varieties of lattices.

This talk is part of the Theoretical computer science seminar series.

This talk is included in these lists:

• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Theoretical computer science seminar
• UG40 Computer Science
• computer sience

Note that ex-directory lists are not shown.