Q: –“Does the work involve mathematical models in the form of symbolic equation

Q: –“Does the work involve mathematical models in the form of symbolic equations relating abstracted components?” —
@HenningSittler

Great question (really).

No. Operational prose is the limit of reducibility in language without introducing generalization that causes ambiguity and thus deductive and inductive error. So whereas simple examples demonstrating regularity are reducible to mathematical or symbolic form, lead to observation of possible generalizations the opposite occurs when one’s scope is the test of particulars. This is a common error in ‘mathiness’ which is itself a statistical grammar of reducibility of regularities. We have within the past decades disambiguated mathematical reducibility from programmatic (algorithmic) reducibility, my work adds operational reducibility. So in these grammars Math: regularity > algorithmic: irregularities > actions: particulars, each serves as a differences in precision for different complexities of operation (degrees of uniqueness).

Essentially math: set logic(highly constrained), algorithms: constrained operational logic, unconstrained operational logic.