Transformations of Logical Graphs • 13

Posted on May 18, 2024 by Jon Awbrey

Semiotic Transformations

Re: Transformations of Logical Graphs • (8) • (9) • (10) • (11) • (12)

Continuing our scan of the Table in Episode 8, the next orbit contains the logical graphs for the boolean functions f_{8} and f_{14}.

\text{Interpretive Duality} \stackrel{_\bullet}{} \text{Conjunction and Disjunction}

Interpretive Duality • Conjunction and Disjunction

The boolean functions f_{8} and f_{14} are called logical conjunction and logical disjunction, respectively.  The values taken by f_{8} and f_{14} for each pair of arguments (x, y) in \mathbb{B} \times \mathbb{B} and the text expressions for their logical graphs are given in the following Table.

Truth Table • Conjunction and Disjunction

Resources

cc: FB | Logical Graphs • Laws of Form • Mathstodon • Academia.edu
cc: Conceptual Graphs • Cybernetics • Structural Modeling • Systems Science

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, Interpretive Duality, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Painted Cacti, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Visualization and tagged , , , , , , , , , , , , , , , , , , , , , , , , . Bookmark the permalink.

3 Responses to Transformations of Logical Graphs • 13

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

  2. Pingback: Transformations of Logical Graphs • 14 | Inquiry Into Inquiry

  3. Pingback: Survey of Animated Logical Graphs • 8 | Inquiry Into Inquiry

Leave a comment

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