Boolean considerations on John Buridan's octagons of opposition (2019), p. 132
by Demey, Lorenz
Copyright according to our policy
Caption
- Two generic Buridan octagons that have Boolean complexity 5, on the assumption that the generic Buridan octagon in Figure 2 has Boolean complexity 6.
- Aristotelian family
- Buridan Sigma-4
- Boolean complexity
- 5
- Number of labels per vertex (at most)
- 1
- Uniqueness of the vertices up to logical equivalence
- Yes
- Errors in the diagram
- No
- Shape
- Octagon (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
- generic placeholders
- 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