Cf: Animated Logical Graphs • 24 https://inquiryintoinquiry.com/2019/07/26/animated-logical-graphs-24/
Re: Ontolog Forum • Joseph Simpson https://groups.google.com/g/ontolog-forum/c/wF03K5KG1vQ/m/ZRlQdavJBgAJ Dear Joe, Boolean functions f : Bⁿ → B 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 happened to run across an enlightening article about it just yesterday and I did a while ago begin an exploration into 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 https://inquiryintoinquiry.com/2014/09/07/frankl-my-dear-1/ ••• https://inquiryintoinquiry.com/2014/11/24/frankl-my-dear-12/ R.J. Lipton and K.W. Regan • Discrepancy Games and Sensitivity https://rjlipton.wpcomstaging.com/2019/07/25/discrepancy-games-and-sensitivity/ Regards, Jon
_ _ _ _ _ _ _ _ _ _ ► PEIRCE-L subscribers: Click on "Reply List" or "Reply All" to REPLY ON PEIRCE-L to this message. PEIRCE-L posts should go to [email protected] . ► To UNSUBSCRIBE, send a message NOT to PEIRCE-L but to [email protected] with UNSUBSCRIBE PEIRCE-L in the SUBJECT LINE of the message and nothing in the body. More at https://list.iupui.edu/sympa/help/user-signoff.html . ► PEIRCE-L is owned by THE PEIRCE GROUP; moderated by Gary Richmond; and co-managed by him and Ben Udell.
