Aristotelian Diagrams for the Proportional Quantifier 'Most' (2023), p. 12
by Smessaert, Hans; Demey, Lorenz
Copyright according to our policy
Caption
- Octagons with bitstrings of length 6 and length 5 for $\mathcal{F}_{\textit{allmost}}$, relative to resp. FOL and SYL.
- Aristotelian family
- Sigma-4 Graph
- Boolean complexity
- 6
- 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
- Octagon (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
- Contains partial formulas or symbols
- Yes
- Contains protobitstrings
- No
- Bitstring length
- 6
- 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
- Yes
- Diagram is embellished
- No
- Tags
- Leuven