Computing the maximal Boolean complexity of families of Aristotelian diagrams (2018), p. 1330
by Demey, Lorenz
Copyright according to our policy
Caption
- (a) Classical square in $\mathsf{KD}$, (b) degenerate square for the same fragment in $\mathsf{K}$, (c) JSB hexagon in $\mathsf{KD}$ and $\mathsf{K}$.
- Aristotelian family
- Classical Sigma-2
- Boolean complexity
- 3
- Number of labels per vertex (at most)
- 1
- Uniqueness of the vertices up to logical equivalence
- Yes
- Errors in the diagram
- No
- Shape
- Rectangle (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
- Symbolic field
- logic
- Contains partial formulas or symbols
- No
- Logical system
- modal logic
- 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
- Leuven