The Unreasonable Effectiveness of Bitstrings in Logical Geometry (2017), p. 204
by Smessaert, Hans; Demey, Lorenz
Copyright according to our policy
Caption
- Three Aristotelian hexagons for $\mathsf{S5}$: (a) strong Jacoby-Sesmat-Blanché, (b) Sherwood-Czeżowski, (c) unconnected-4
- Aristotelian family
- Degenerate Sigma-3 with Unconnectedness 4
- Boolean complexity
- 4
- 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 (regular)
- 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
- bitstrings ,
- logic
- Contains partial formulas or symbols
- No
- Contains protobitstrings
- No
- Bitstring length
- 4
- Logical system
- modal logic
- Contains definitions of relations
- No
- Form
- dotted lines ,
- solid lines ,
- none ,
- 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