Objecting to uncertain conditional sentences. A cross-linguistic study (2020), p. 138
by Politzer, Guy; Baratgin, Jean; Hattori, Ikuko; Hattori, Masasi
Copyright according to our policy
- Aristotelian family
- Non-Sigma
- Boolean complexity
- 5
- 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
- Hexagon (regular)
- Colinearity range
- 0
- Coplanarity range
- 0
- Cospatiality range
- 0
- Representation of contradiction
- N.A.
Logic
Geometry
- Conceptual info
- Yes
- Mnemonic support (AEIO, purpurea ...)
- No
- Form
- none
- Label type
- linguistic ,
- symbolic ,
- generic placeholders
- Language
- English
- Lexical field
- modalities
- Contains partial sentences or single words
- Yes
- Contains abbreviations
- No
- Symbolic field
- mathematics
- Contains partial formulas or symbols
- No
- Mathematical branch
- order theory
Vertex description
Edge description
- Diagram is colored
- No
- Diagram is embellished
- No
Style
Additional notes
- The negation closure of this diagram involves adding the negations of B and B'. This negation closure is a Lenzen sigma-4. (A more canonical visualization of both this diagram and its negation closure would involve rotating the diagram 90° counterclockwise, so that the subalternations are pointing downwards.)