Room P3.10, Mathematics Building

Umberto Rivieccio, UFRN, Brazil
Super-Belnap logics

Belnap-Dunn logic is a well-known four-valued logic that has been widely applied in computer science since its introduction forty years ago. From an algebraic logic point of view, it is an interesting and natural example of a non-protoalgebraic logic. I will take a look at extensions (i.e. stronger logics, but in the same language) of this logic. The final aim would be to describe their hierarchy and providing axiomatizations for (some of) them. However, major difficulties in accomplishing this stem from the fact that (1) most super-Belnap logics are themselves non-protoalgebraic and (2) there are (at least) uncountably many of them.