Difference between revisions of "Trinary index"
From Maths
(Created page with "A trinary index is a way of indexing lists of theorems by their properties. It works as follows: {| class="wikitable sortable" border="1" |- ! Theorem ! class="unsortable" |...") |
m |
||
| Line 21: | Line 21: | ||
|} | |} | ||
Notice the way the keys are sorted. | Notice the way the keys are sorted. | ||
| + | |||
| + | ==Editors notes== | ||
| + | * The key values are empty-false-maybe-true in that order | ||
Latest revision as of 20:55, 22 June 2015
A trinary index is a way of indexing lists of theorems by their properties. It works as follows:
| Theorem | A | B | C | ⟶ | X | Y | Z |
|---|---|---|---|---|---|---|---|
| Theorem fff-mmt | F | F | F | ⟺ | M | M | T |
| Theorem ffm-ttf | F | F | M | ⟹ | T | T | F |
| Theorem ttf-tmf | T | T | F | ⟹ | T | M | F |
| Theorem ttt-tmf | T | T | T | ⟹ | T | M | F |
Notice the way the keys are sorted.
Editors notes
- The key values are empty-false-maybe-true in that order
