"Setting" n-Opposition (2008), p. 253
by Pellissier, Régis

Copyright according to our policy

Logic

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

Geometry

Shape

Three Dimensional Shape (irregular)

Colinearity range

0

Coplanarity range

0

Cospatiality range

0

Representation of contradiction

By central symmetry

Vertex description

Conceptual info

No

Mnemonic support (AEIO, purpurea ...)

No

Form

none

Label type

symbolic

Symbolic field

mathematics

Mathematical branch

set theory

Edge description

Style

Diagram is colored

No

Diagram is embellished

No

Additional notes

From the CO-perspective, this is a C4O1 diagram. (Two strong JSB sigma-3's that are intertwined with each other.)

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.