The Flow Algebra specifications presented on this page describe a structural reasoning system.
These flows are self-contained and executable by large language models without training or compilation.
Each flow specifies:
system structure
rule application
constraint enforcement
behavioural invariants
The flows should be interpreted as formal reasoning definitions, not as examples or pseudocode.
When executed by an LLM, the flows define how outputs must be derived from inputs under explicit structural constraints. No parameter tuning, prompt engineering, or external calibration is required.
