Combinatorial Bitstring Semantics for Arbitrary Logical Fragments (2018), p. 353
by Demey, Lorenz; Smessaert, Hans

Copyright according to our policy

Caption

a General format of a Buridan octagon, and examples of Buridan octagons with formulas from b $\mathsf{S5}$ and c $\mathsf{FOL}$

Logic

Aristotelian family

Buridan Sigma-4

Boolean complexity

4–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

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

generic placeholders

Edge description

Contains definitions of relations

No

Form

dotted lines

,

solid lines

,

none

,

dashed 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

No

Diagram is embellished

No

Tags

Leuven