Computation of Aristotle's and Gergonne's syllogisms (1987), p. 211
by Furs, S. N.
Copyright according to our policy
- Aristotelian family
- Degenerate Sigma-3 with Unconnectedness 4
- Boolean complexity
- 5
- Number of labels per vertex (at most)
- 1
- Uniqueness of the vertices up to logical equivalence
- Yes
- Errors in the diagram
- No
- Shape
- Rectangle (irregular)
- Colinearity range
- 0–1
- Coplanarity range
- 0
- Cospatiality range
- 0
- Representation of contradiction
- By some other geometric feature
Logic
Geometry
- Conceptual info
- Yes
- Mnemonic support (AEIO, purpurea ...)
- Yes
- Form
- circular
- Label type
- symbolic
- Symbolic field
- logic
- Contains partial formulas or symbols
- Yes
- Logical system
- syllogistics
- Contains definitions of relations
- No
- Form
- solid lines
- Has arrowheads
- Yes
- Overlap
- No
- Curved
- Yes
- Hooked
- No
- As wide as vertices
- No
- Contains text
- Yes
- Label type
- linguistic ,
- symbolic
- Language
- English
- Contains partial sentences or single words
- Yes
- Contain abbreviations
- Yes
- Symbolic field
- mathematics
- Contains partial formulas or symbols
- Yes
- Mathematical branch
- order theory
Vertex description
Edge description
- Diagram is colored
- No
- Diagram is embellished
- No
- Tags
- non-contingent formulas
Style
Additional notes
- In the logical and geometrical annotation of this diagram, the presence of the top/tautological element (1) has been disregarded.