# Computing the maximal Boolean complexity of families of Aristotelian diagrams (2018), p. 1334

by Demey, Lorenz

Copyright according to our policy

### Caption

- (a) Generic description of the Aristotelian family of degenerate squares, (b) maximal bitstring representation of the Aristotelian family of JSB hexagons (= bitstring representation of the Boolean subfamily of weak JSB hexagons), (c) bitstring representation of the Boolean subfamily of strong JSB hexagons.

- Aristotelian family
- Jacoby-Sesmat-BlanchÃ© Sigma-3
- Boolean complexity
- 3
- Number of labels per vertex (at most)
- 2
- Equivalence between (some) labels of the same vertex
- No
- Analogy between (some) labels of the same vertex
- No
- Uniqueness of the vertices up to logical equivalence
- Yes
- Errors in the diagram
- No
- Shape
- Hexagon (irregular)
- Colinearity range
- 0
- Coplanarity range
- 0
- Cospatiality range
- 0
- Representation of contradiction
- By central symmetry

### Logic

### Geometry

- Conceptual info
- No
- Mnemonic support (AEIO, purpurea ...)
- No
- Form
- none
- Label type
- symbolic ,
- generic placeholders
- Symbolic field
- bitstrings
- Contains partial formulas or symbols
- No
- Contains protobitstrings
- No
- Bitstring length
- 3
- Contains definitions of relations
- No
- Form
- dotted lines ,
- solid lines ,
- dashed lines
- Has arrowheads
- Yes
- Overlap
- No
- Curved
- No
- Hooked
- No
- As wide as vertices
- No
- Contains text
- No
- Label type
- none

### Vertex description

### Edge description

- Diagram is colored
- No
- Diagram is embellished
- No
- Tags
- Boolean closed ;
- Leuven