In the graph view you could find 6 differently colored nodes, plus the uncolored grey nodes; ideally there would be only colored notes in the network.
| Type | Color | Hex-Code | Description | Example |
|---|---|---|---|---|
| Hinge | #DDCC77 | Apodictic posing sentences, that act fundamental for the network. | Axioms, Principles, Fundamental Laws of Physic | |
| Assumption | #332288 | Sentences that need to be fulfilled for another sentence to hold true. | Constraints, Edge Conditions | |
| Derivation | #CC6677 | Mathematical or Logical sentences by derivation from another. | Compositions, Lemmas | |
| Relational | #882255 | Sentences that relate to co-conditions and not fall under the types derivation or assumption. | Confounder | |
| Regular | #44AA99 | Regularly, law-like, or scholastically predictive sentences; formalized expectations. | Local physical laws, Matthew-Effect | |
| Observational | #88CCEE | Sentences, that describe concrete observable situations or are functional in concrete observations or predictions. | Hypothesis, Predictions |
The color-scheme should be accessible for color blind people and is by Paul Tol and was found on Davis Nichols site. The scheme has 8 colors thus two colors could still be used for later additions:
| #117733 | |
| #AA4499 |
The typology of sentences used here was developed in my master thesis. The classes Assumptions, Derivations and Relational where clamped to a class of sentences that disambiguate or relate other sentences. Interestingly I couldn’t seem to find a clear short name for this class.