Set networks - organizing ideas:
⁃ All information can be organized as sets of symbols and sets
⁃ Symbols are in fact common pointers to sets within the contextual universe
⁃ A set pointed to by a symbol need not be and rarely will be fully defined, and it is not necessary that it be so for communication to occur with it.
⁃ Language itself is an analog for set networks, but requires a system of rules to parse.
⁃ A symbol may be ambiguous, but is self contained with its context
⁃ Recursion and sequence are the same concept
⁃ Disambiguation is the primary method of interpretation
⁃ Same-level symbolic interpretation can occur by way of symbolic implication
⁃ Higher-level symbolic interpretation can occur by way of polling symbolic restriction
⁃ Further symbolic interpretation can occur by way of symbolic abstraction
Simple logical operators:
=> rightwise implication
<= leftwise implication
= bidirectional implication
: inclusion declaration
| where restriction
! context delimiter
[ ] optional
{ } non-ordered set
( ) ordered set
< > local wildcard
From this framework we can create arbitrarily complex symbolic prediction networks.
More to come.