Animated Logical Graphs • 24

Re: Ontolog Forum • Joseph Simpson

Boolean functions and different ways of contemplating their complexity are definitely the right ballpark, or at least the right planet, for field-testing logical graphs.

I don’t know much about the Boolean Sensitivity Conjecture but I did run across an enlightening article about it just yesterday and I did once begin an exploration of what appears to be a related question, Péter Frankl’s “Union-Closed Sets Conjecture”.  See the resource pages linked below.

At any rate, now that we’ve entered the ballpark, or standard orbit, of boolean functions, I can skip a bit of dancing around and jump to the next blog post I have on deck.

Resources

• Frankl Conjecture
• R.J. Lipton and K.W. Regan • Discrepancy Games and Sensitivity

cc: Systems Science • Structural Modeling • Ontolog Forum • Laws of Form • Cybernetics