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

Combinatorial Bitstring Semantics for Arbitrary Logical Fragments (2018), p. 351
by Demey, Lorenz; Smessaert, Hans

Copyright according to our policy

Caption

a General format of a JSB hexagon, b example of a strong JSB hexagon, c example of a weak JSB hexagon

Logic

Aristotelian family
Jacoby-Sesmat-Blanché Sigma-3
Boolean complexity
3–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
Hexagon (regular)
Colinearity range
0
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
generic placeholders

Edge description

Contains definitions of relations
No
Form
dotted lines
,
solid lines
,
dashed lines
Has arrowheads
Yes
Overlap
No
Curved
No
Hooked
No
As wide as vertices
No
Contains text
No
Label type
none

Style

Diagram is colored
No
Diagram is embellished
No
Tags
Leuven
↑ Back to top ↑