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

From the Square to Octahedra (2017), p. 264
by García-Cruz, José David

Caption

Base $=$ HD1

Logic

Aristotelian family
Jacoby-Sesmat-Blanché Sigma-3
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
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
symbolic
Symbolic field
logic
Contains partial formulas or symbols
No
Logical system
propositional logic

Edge description

Contains definitions of relations
No
Form
solid 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
Yes
Diagram is embellished
No

Additional notes

$Lpq = p\wedge \neg q$
$Kpq = p \wedge q$
$Dpq = \neg(p \wedge q)$
$Cpq = p\to q$
$Xpq = \neg p \wedge \neg q$
$Vpq = p \vee q$

(Cf. p. 254.)
↑ Back to top ↑