You're using an ancient browser to surf the modern web. Please update to the latest version (and don't use Internet Explorer!).

Leonardi.DB
a logical geometry project

Knowledge, certainty and probability (1963), p. 248
by Heidelberger, Herbert

Logic

Aristotelian family
Béziau Sigma-4
Boolean complexity
4
Number of labels per vertex (at most)
1
Uniqueness of the vertices up to logical equivalence
Yes
Errors in the diagram
No

Geometry

Shape
Square (regular)
Colinearity range
0–1
Coplanarity range
0
Cospatiality range
0
Representation of contradiction
By central symmetry

Vertex description

Conceptual info
No
Mnemonic support (AEIO, purpurea ...)
No
Form
none
Label type
linguistic
Language
English
Lexical field
quantifiers
Contains partial sentences or single words
Yes
Contains abbreviations
Yes

Edge description

Style

Diagram is colored
No
Diagram is embellished
No

Additional notes

"F, G universal means: ~(Some F are G) or ~(Some F are not G)
F, G mixed means: Some F are G and some F are not G.
[...]
F, G probable means: It is more probable that an F is a G than that an F is not a G.
F, G not probable means: ~(F, G probable)." (p. 248)
↑ Back to top ↑