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

Computing the maximal Boolean complexity of families of Aristotelian diagrams (2018), p. 1334
by Demey, Lorenz

Copyright according to our policy

Caption

(a) Generic description of the Aristotelian family of degenerate squares, (b) maximal bitstring representation of the Aristotelian family of JSB hexagons (= bitstring representation of the Boolean subfamily of weak JSB hexagons), (c) bitstring representation of the Boolean subfamily of strong JSB hexagons.

Logic

Aristotelian family
Degenerate Sigma-2 with Unconnectedness 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
Rectangle (irregular)
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
solid lines
,
none
Has arrowheads
No
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 ↑