# Combinatorial Bitstring Semantics for Arbitrary Logical Fragments (2018), p. 355

by Demey, Lorenz; Smessaert, Hans

Copyright according to our policy

### Caption

- The two Buridan octagons and their bitstrings representations

- Aristotelian family
- Buridan Sigma-4
- Boolean complexity
- 6
- Number of labels per vertex (at most)
- 2
- Equivalence between (some) labels of the same vertex
- No
- Analogy between (some) labels of the same vertex
- No
- Uniqueness of the vertices up to logical equivalence
- Yes
- Errors in the diagram
- No
- Shape
- Octagon (regular)
- Colinearity range
- 0
- Coplanarity range
- 0
- Cospatiality range
- 0
- Representation of contradiction
- By central symmetry

### Logic

### Geometry

- Conceptual info
- No
- Mnemonic support (AEIO, purpurea ...)
- No
- Form
- none
- Label type
- symbolic
- Symbolic field
- bitstrings ,
- logic
- Contains partial formulas or symbols
- No
- Contains protobitstrings
- No
- Bitstring length
- 6
- Logical system
- modal logic
- 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

### Vertex description

### Edge description

- Diagram is colored
- No
- Diagram is embellished
- No
- Tags
- Leuven

### Style

### Additional notes

- $Q_1Q_2(\neg)$ abbreviates the first-order formula $Q_1xQ_2y(\neg)R(x,y)$, for $Q_1,Q_2 \in\{\forall,\exists\}$; cf. p. 353.