Relational Logic of Juan Caramuel (2008), p. 652
by Dvořák, Petr

Copyright according to our policy

Logic

Aristotelian family

Non-Sigma

Boolean complexity

3

Number of labels per vertex (at most)

2

Equivalence between (some) labels of the same vertex

Yes

Analogy between (some) labels of the same vertex

No

Uniqueness of the vertices up to logical equivalence

Yes

Errors in the diagram

No

Geometry

Shape

Pentagon (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

rectangular

Label type

symbolic

Symbolic field

logic

Contains partial formulas or symbols

Yes

Logical system

deontic logic

Edge description

Style

Diagram is colored

No

Diagram is embellished

No

Additional notes

The negation closure of this diagram is a JSB sigma-3.

D stands for 'must'; P stands for 'can' (cf. p. 651).