Logical Diagrams, Visualization Criteria, and Boolean Algebras (2022), p. 219
by Bolz, Roland
Copyright according to our policy
- Number of labels per vertex (at most)
- 1
- 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
- dots
- Label type
- symbolic
- Symbolic field
- mathematics
- Mathematical branch
- set theory
- Contains definitions of relations
- No
- Form
- solid 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
- Yes
- Diagram is embellished
- No
Style
Additional notes
- This diagram is decorated with Pellissier's "setting" technique, which is equivalent to bitstring semantics. In particular, $\wp(\{a,b,c,d\})$ corresponds to bitstrings of length 4.