Why the Logical Hexagon? (2012), p. 102
by Moretti, Alessio

Copyright according to our policy

Caption

Sesmat’s unaccomplished $n$-opposition (1951)

Logic

Aristotelian family

Sigma-9 Clique

Boolean complexity

9–10

Number of labels per vertex (at most)

1

Uniqueness of the vertices up to logical equivalence

Yes

Errors in the diagram

No

Geometry

Shape

Heptagon (irregular)

Colinearity range

0–1

Coplanarity range

9

Cospatiality range

0

Representation of contradiction

By some other geometric feature

Vertex description

Conceptual info

Yes

Mnemonic support (AEIO, purpurea ...)

Yes

Form

none

Label type

generic placeholders

Edge description

Contains definitions of relations

No

Form

solid lines

,

none

Has arrowheads

Yes

Overlap

No

Curved

No

Hooked

No

As wide as vertices

No

Contains text

No

Label type

none

Style

Diagram is colored

No

Diagram is embellished

No