quality:corruption, stylistic:style_transfer
Table and Hasse diagram

The 16 logical connectives can be partially ordered to produce the following Hasse diagram. The partial order is defined by declaring that x ≤ y {\displaystyle x\leq y} if and only if whenever x {\displaystyle x} holds then so does y. {\displaystyle y.}