Hi, I'm new to this forum and to Wolfram Notebooks. Even the Wolfram Language is new to me. I'm working on a Notebook about a substitutional rewriting system for Boolean algebra. The main idea is to apply a rewriting system for Boolean expressions where the substitution for variables is initially done. For example an expression like: And[x, Or[z, y]] becomes through substitution with x = 1, y = 0 and z = 1: And[1, Or[1, 0]] and then a term rewriting system iterates on this expression until no more changes are made.
The rationale for this approach is that rewriting systems in general tend to produce iterations that become very large, and by first applying substitution for the variables with constant values the iterations in the Boolean case quickly generate a reduction to either True or False (0 or 1). When the MultiwayCombinator is set to "Sequential" mode the iterations reduce faster, yet the multiway approach seems to produce the exact same results even though it produces longer expressions in the chain of rewriting.
If you have further ideas, or know of a similar approach already been made, feel free to give me feedback. And comments in general about this approach are also appreciated since this is for me an experimental approach.
