Boolean Subtypes of the U4 Hexagon of Opposition

Abstract

This paper investigates the so-called ‘unconnectedness-4 (U4) hexagons of opposition’, which have various applications across the broad field of philosophical logic. We first study the oldest known U4 hexagon, the conversion closure of the square of opposition for categorical statements. In particular, we show that this U4 hexagon has a Boolean complexity of 5, and discuss its connection with the so-called ‘Gergonne relations’. Next, we study a simple U4 hexagon of Boolean complexity 4, in the context of propositional logic. We then return to the categorical square and show that another (quite subtle) closure operation yields another U4 hexagon of Boolean complexity 4. Finally, we prove that the Aristotelian family of U4 hexagons has no other Boolean subtypes, i.e., every U4 hexagon has a Boolean complexity of either 4 or 5. These results contribute to the overarching goal of developing a comprehensive typology of Aristotelian diagrams, which will allow us to systematically classify these diagrams into various Aristotelian families and Boolean subfamilies.