University of Birmingham > Talks@bham > Theoretical computer science seminar > Bilattices: an algebraic (logic) perspective

Bilattices: an algebraic (logic) perspective

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.