the simplest formal logic: propositions connected by AND, OR, NOT, implication
truth tables define the meaning of every compound statement. decidable — every formula can be mechanically checked.
in the cybergraph: a proposition is a particle, truth value is its focus weight. conjunction is co-linking, disjunction is alternative paths, negation is the absence of a cyberlink. the tri-kernel computes satisfiability by convergence rather than enumeration.
foundation for all other logics — predicate logic, modal logic, temporal logic, fuzzy logic extend it with quantifiers, modalities, time, or continuous truth values.