"Setting" n-Opposition (2008), p. 252
by Pellissier, Régis
Copyright according to our policy
- Aristotelian family
- Jacoby-Sesmat-Blanché Sigma-3
- 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
- symbolic
- Symbolic field
- mathematics
- Mathematical branch
- set theory
Vertex description
Edge description
- Diagram is colored
- No
- Diagram is embellished
- No
- Tags
- subdiagram
Style
Additional notes
- This diagram is decorated with Pellissier's "setting" technique, which is equivalent to bitstring semantics. In particular, $\wp(\{1,2,3,4\})$ corresponds to bitstrings of length 4.