Animated Logical Graphs • 24

Re: Ontolog ForumJoseph Simpson

Boolean functions f : \mathbb{B}^k \to \mathbb{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 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.


cc: Systems ScienceStructural ModelingOntolog ForumLaws of FormCybernetics

This entry was posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Constraint Satisfaction Problems, Deduction, Diagrammatic Reasoning, Duality, Equational Inference, Graph Theory, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Painted Cacti, Peirce, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Theorem Proving, Visualization and tagged , , , , , , , , , , , , , , , , , , , , , , , , , . Bookmark the permalink.

1 Response to Animated Logical Graphs • 24

  1. Pingback: Survey of Animated Logical Graphs • 2 | Inquiry Into Inquiry

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.