A solution to the knowability paradox and the paradox of idealization in modal epistemic languages (2014), p. 29
by Akçelik, Oğuz
Copyright according to our policy
Caption
- The Knowability Paradox Square
- Aristotelian family
- Classical Sigma-2
- Boolean complexity
- 3
- Number of labels per vertex (at most)
- 1
- 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
Vertex description
Edge description
- Diagram is colored
- No
- Diagram is embellished
- No