Oppositions in Rough Set Theory (2012), p. 506
by Ciucci, Davide; Dubois, Didier; Prade, Henri

Copyright according to our policy

Caption

The tetrahedron of the 16 binary connectives

Logic

Aristotelian family

Classical Sigma-7

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

Tetrahedron (regular)

Colinearity range

1

Coplanarity range

1

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

logic

Contains partial formulas or symbols

No

Logical system

propositional logic

Edge description

Style

Diagram is colored

No

Diagram is embellished

No

Tags

Boolean closed