Re: Laws of Form • Lyle Anderson
Re: Anderson, Lyle A. III (1981), “Systematic Analysis of Algorithms”,
Open Access Master’s Theses, Paper 1167, (1) (2).

Thanks, Lyle, your Chapter 4, “Dealing With Conditional Statements”, provides a detailed treatment of algorithmic branching constructs in general purpose programming languages but as you noted in saying, “we are already way outside the realm of truth tables with only and it tangos with a much-higher-maintenance date than the one John Mingers brought to the dance.

I think we are making this problem harder than it needs to be.  Let’s go back to the original question and try to view it with fresh eyes.  All we have to decide is which candidate among the three-variable boolean functions provides a reasonable mathematical proxy for what we mean when we say,   Experience with informal-to-formal translation tells us there may be no functional form capturing every nuance of a natural language idiom but there is usually one serving all practical purposes in empirical and mathematical contexts.

Resources

• Cactus Rules • NKS Forum • Inquiry List • Ontology List

cc: Cybernetics • Ontolog • Peirce List (1) (2) (3) • Structural Modeling • Systems Science
cc: FB | Logical Graphs • Laws of Form