Einführung in die Logik (2008), p. 134
by Löffler, Winfried
Copyright according to our policy
- Aristotelian family
- Classical Sigma-2
- Boolean complexity
- 3
- Number of labels per vertex (at most)
- 2
- Equivalence between (some) labels of the same vertex
- Yes
- Analogy between (some) labels of the same vertex
- No
- Uniqueness of the vertices up to logical equivalence
- Yes
- 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
Graph structure
-
$\neg(\exists x)(Sx)$
$(\forall x)(\neg Sx)$
$(\forall x)(Sx)$
$\neg(\exists x)(\neg Sx)$
$(\exists x)(Sx)$
$\neg(\forall x)(\neg Sx)$
$\neg(\forall x)(Sx)$
$(\exists x)(\neg Sx)$
- Conceptual info
- No
- Mnemonic support (AEIO, purpurea ...)
- No
Vertex description
Edge description
- Diagram is colored
- No
- Diagram is embellished
- No