"Setting" n-Opposition (2008), p. 249
by Pellissier, RĂ©gis
Copyright according to our policy
- Aristotelian family
- Sigma-5 Graph
- Boolean complexity
- 4
- Number of labels per vertex (at most)
- 1
- Uniqueness of the vertices up to logical equivalence
- Yes
- Errors in the diagram
- No
- Shape
- Three Dimensional Shape (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
Vertex description
Edge description
- Diagram is colored
- No
- Diagram is embellished
- No
Style
Additional notes
- From the CO-perspective, this is a C4O1 diagram. (Two strong JSB sigma-3's that are intertwined with each other.)
Bitstring semantics:
A = 1000
B = 1100
C = 1110