Understanding Arguments. An Introduction to Informal Logic (2010), p. 188
by Sinnott-Armstrong, Walter; Fogelin, Robert J.
Copyright according to our policy
- Aristotelian family
- A Single PCD
- Boolean complexity
- 2
- Number of labels per vertex (at most)
- 3
- Equivalence between (some) labels of the same vertex
- No
- Analogy between (some) labels of the same vertex
- No
- Uniqueness of the vertices up to logical equivalence
- Yes
- Errors in the diagram
- No
- Shape
- Digon (regular)
- Colinearity range
- 0
- Coplanarity range
- 0
- Cospatiality range
- 0
- Representation of contradiction
- By central symmetry
Logic
Geometry
- Conceptual info
- No
- Mnemonic support (AEIO, purpurea ...)
- Yes
- Form
- none
- Label type
- linguistic ,
- symbolic ,
- iconic
- Language
- English
- Lexical field
- syllogistics
- Contains partial sentences or single words
- No
- Contains abbreviations
- Yes
- Symbolic field
- logic
- Contains partial formulas or symbols
- Yes
- Logical system
- syllogistics
- Contains definitions of relations
- No
- Form
- none
- Has arrowheads
- No
- Overlap
- No
- Curved
- No
- Hooked
- No
- As wide as vertices
- No
- Contains text
- No
- Label type
- none
Vertex description
Edge description
- Diagram is colored
- No
- Diagram is embellished
- No
- Tags
- Boolean closed