Abstract
The Belnap-Dunn logic (also known as First Degree Entailment, or FDE) is a well-known and well-studied four-valued logic, but until recently little has been known about its extensions, i.e. stronger logics in the same language, called super-Belnap logics here. We give an overview of several results on these logics which have been proved in recent works by Prenosil and Rivieccio.
We present Hilbert-style axiomatizations, describe reduced matrix models, and give a description of the lattice of super-Belnap logics and its connections with graph theory. We adopt the point of view of Abstract Algebraic Logic, exploring applications of the general theory of algebraization of logics to the super-Belnap family.
In this respect we establish a number of new results, including a description of the algebraic counterparts, Leibniz filters, and strong versions of super-Belnap logics, as well as the classification of these logics within the Leibniz and Frege hierarchies.