Leonardi.DB - Diagrams

General

Date

Treat uncertainty ranges strict

Contributors

Exactly these contributors

Information

Has a legend
Yes No

Has a caption
Yes No

Contains errors
Yes No

Tags

Exactly these tags

Logic

Aristotelian family

Proper interpretation (see hierarchy)

Boolean complexity

Treat uncertainty ranges strict

Vertex labels

Include diagrams with a single label
Include diagrams with multiple labels

Uniqueness

Vertices are unique up to logical equivalence
Yes No

Geometry

Geometric shape

Proper interpretation (see hierarchy)

Regular
Yes No

Geometric representation of contradiction

By central symmetry

By diametric opposition (but no central symmetry)

By some other geometric feature

N.A.

Geometric complexity

Has non-zero colinearity, coplanarity or cospatiality
Yes No

Style: general

Visuals

Colored
Yes No

Embellished
Yes No

Information

Contains conceptual info
Yes No

Contains mnemonic info
Yes No

Contains definitions
Yes No

Style: vertex labels

Label type

Exactly these label types

Linguistic characteristics

Language

Exactly these languages

Lexical field

Exactly these fields

Contains abbreviations
Yes No

Contains partial sentences
Yes No

Symbolic characteristics

Symbolic field

Exactly these fields

Logical system

Exactly these systems

Mathematical branch

Exactly these branches

Contains partial formulas
Yes No

Bitstring characteristics

Contains protobitstrings
Yes No

Style: edge labels

Label type

Exactly these label types

Linguistic characteristics

Language

Exactly these languages

Contains abbreviations
Yes No

Contains single words
Yes No

Symbolic characteristics

Symbolic field

Exactly these fields

Logical system

Exactly these systems

Mathematical branch

Exactly these branches

Contains partial formulas
Yes No

Bitstring characteristics

Contains protobitstrings
Yes No

Style: diagram form

Vertex form

Exactly these forms

Edge form

Exactly these forms

Contains arrowheads
Yes No

Contains overlapping edges
Yes No

Contains curved edges
Yes No

Contains hooked edges
Yes No

Contains vertex-wide edges
Yes No

Contains text in edges
Yes No

Source	Date (min⁠–⁠max)	Aristotelian Family	B.C. (min⁠–⁠max)	Geometric Shape
An analogical hexagon, p. 7, by Beziau, Jean-Yves	2018	Classical Sigma-2	3	Rectangle
An analogical hexagon, p. 8, by Beziau, Jean-Yves	2018	Jacoby-Sesmat-Blanché Sigma-3	3–4	Hexagon
An analogical hexagon, p. 8, by Beziau, Jean-Yves	2018	Contrariety 3-clique	4	Triangle
An analogical hexagon, p. 8, by Beziau, Jean-Yves	2018	Jacoby-Sesmat-Blanché Sigma-3	3–4	Hexagon
An analogical hexagon, p. 9, by Beziau, Jean-Yves	2018	A Single PCD	2	Digon
An analogical hexagon, p. 9, by Beziau, Jean-Yves	2018	Contrariety 3-clique	3	Triangle
An analogical hexagon, p. 9, by Beziau, Jean-Yves	2018	A Single PCD	2	Digon
An analogical hexagon, p. 9, by Beziau, Jean-Yves	2018	Contrariety 3-clique	3	Triangle
An analogical hexagon, p. 9, by Beziau, Jean-Yves	2018	Jacoby-Sesmat-Blanché Sigma-3	3	Hexagon
An analogical hexagon, p. 10, by Beziau, Jean-Yves	2018	Jacoby-Sesmat-Blanché Sigma-3	3	Hexagon
An analogical hexagon, p. 11, by Beziau, Jean-Yves	2018	Classical Sigma-2	3	Rectangle
An analogical hexagon, p. 12, by Beziau, Jean-Yves	2018	Jacoby-Sesmat-Blanché Sigma-3	4	Hexagon
An analogical hexagon, p. 12, by Beziau, Jean-Yves	2018	Contrariety 3-clique	3–4	Triangle
An analogical hexagon, p. 13, by Beziau, Jean-Yves	2018	Contrariety 4-clique	4	Tetrahedron
An analogical hexagon, p. 10, by Beziau, Jean-Yves	2018	Non-Sigma	3	Triangle
An analogical hexagon, p. 11, by Beziau, Jean-Yves	2018	Non-Sigma	3	Triangle
An analogical hexagon, p. 12, by Beziau, Jean-Yves	2018	Non-Sigma	3	Triangle
Computing the maximal Boolean complexity of families of Aristotelian diagrams, p. 1325, by Demey, Lorenz	2018	Classical Sigma-2	3	Rectangle
Computing the maximal Boolean complexity of families of Aristotelian diagrams, p. 1325, by Demey, Lorenz	2018	Degenerate Sigma-2 with Unconnectedness 4	4	Rectangle
Computing the maximal Boolean complexity of families of Aristotelian diagrams, p. 1325, by Demey, Lorenz	2018	Jacoby-Sesmat-Blanché Sigma-3	3	Hexagon
Computing the maximal Boolean complexity of families of Aristotelian diagrams, p. 1325, by Demey, Lorenz	2018	Jacoby-Sesmat-Blanché Sigma-3	4	Hexagon
Computing the maximal Boolean complexity of families of Aristotelian diagrams, p. 1325, by Demey, Lorenz	2018	Classical Sigma-2	3	Rectangle
Computing the maximal Boolean complexity of families of Aristotelian diagrams, p. 1330, by Demey, Lorenz	2018	Classical Sigma-2	3	Rectangle
Computing the maximal Boolean complexity of families of Aristotelian diagrams, p. 1330, by Demey, Lorenz	2018	Degenerate Sigma-2 with Unconnectedness 4	4	Rectangle
Computing the maximal Boolean complexity of families of Aristotelian diagrams, p. 1330, by Demey, Lorenz	2018	Jacoby-Sesmat-Blanché Sigma-3	3–4	Hexagon