Logique formelle (2009), p. 62
by Peeters, Marc; Richard, Sébastien
Copyright according to our policy
- Aristotelian family
- A Single PCD
- Boolean complexity
- 2
- Number of labels per vertex (at most)
- 1
- Uniqueness of the vertices up to logical equivalence
- No
- Errors in the diagram
- No
- Shape
- Rectangle (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
- solid lines
- Has arrowheads
- No
- Overlap
- No
- Curved
- No
- Hooked
- No
- As wide as vertices
- No
- Contains text
- Yes
- Label type
- linguistic
- Language
- French
- Contains partial sentences or single words
- Yes
- Contain abbreviations
- No
Vertex description
Edge description
- Diagram is colored
- No
- Diagram is embellished
- No
- Tags
- Boolean closed ;
- duality
Style
Additional notes
- The term 'dual(e)' is used in a non-standard sense here. For example, the dual of $A \wedge B$ is not defined as $A \vee B$, but rather as $\neg A \vee \neg B$.