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

Caramuel's Theory of Opposition (2017), p. 365
by Lenzen, Wolfgang

Logic

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

Geometry

Shape
Kite (irregular)
Colinearity range
0
Coplanarity range
0
Cospatiality range
0
Representation of contradiction
N.A.

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
predicate logic

Edge description

Contains definitions of relations
No
Form
none
,
bands
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

Additional notes

The negation closure of this diagram is a Buridan sigma-4; cf. here.

DQ1: $\forall x\forall y E(x,y)$
DQ2: $\exists x\forall y E(x,y)$
DQ3: $\forall x\exists y E(x,y)$
DQ4: $\exists x\exists y E(x,y)$
DQ5: $\exists x\exists y \neg E(x,y)$
DQ6: $\forall x\exists y \neg E(x,y)$
DQ7: $\exists x\forall y \neg E(x,y)$
DQ8: $\forall x\forall y \neg E(x,y)$

Cf. p. 360.
↑ Back to top ↑