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

Not Only Barbara (2015), p. 124
by Dekker, Paul

Logic

Aristotelian family
Non-Sigma
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
Tetrahedron (irregular)
Colinearity range
0
Coplanarity range
0
Cospatiality range
0
Representation of contradiction
N.A.

Vertex description

Conceptual info
No
Mnemonic support (AEIO, purpurea ...)
Yes
Form
none
Label type
symbolic
Symbolic field
logic
Contains partial formulas or symbols
No
Logical system
syllogistics

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

Additional notes

AäB = A'eB = $\forall x(\neg Ax \to \neg Bx)$

(Cf. p. 99.)

The negation closure of this diagram is a JSB sigma-3 (cf. here), if we assume not only existential import, but also 'differential import': "The $\textit{differential import}$ of a proposition AuB is that A and B make a different proper distinction, i.e., $A \neq \emptyset \neq A'$, $B \neq \emptyset \neq B'$ and $A \neq B \neq A'$." (p. 100).
↑ Back to top ↑