Operator Variables in Logical Graphs • 10

Re: Operator Variables in Logical Graphs • 9

Let’s examine the Formal Operation Table for the third in our series of reflective forms to see if we can elicit the general pattern.

Formal Operation Table (a,b,c) • Variant 1

Alternatively, if we think in terms of the corresponding cactus graphs, writing {}^{\backprime\backprime} \texttt{o} {}^{\prime\prime} for an unmarked node and {}^{\backprime\backprime} \texttt{|} {}^{\prime\prime} for a terminal edge, we get the following Table.

Formal Operation Table (a,b,c) • Variant 2

Evidently, the rule is that {}^{\backprime\backprime} \texttt{(} a \texttt{,} b \texttt{,} c \texttt{)} {}^{\prime\prime} denotes the value denoted by {}^{\backprime\backprime} \texttt{o} {}^{\prime\prime} if and only if exactly one of the variables a, b, c has the value denoted by {}^{\backprime\backprime} \texttt{|} {}^{\prime\prime}, otherwise {}^{\backprime\backprime} \texttt{(} a \texttt{,} b \texttt{,} c \texttt{)} {}^{\prime\prime} denotes the value denoted by {}^{\backprime\backprime} \texttt{|} {}^{\prime\prime}.  Examining the whole series of reflective forms shows this to be the general rule.

  • In the Entitative Interpretation (\mathrm{En}), where \texttt{o} = false and \texttt{|} = true,
    {}^{\backprime\backprime} \texttt{(} x_1 \texttt{,} \ldots \texttt{,} x_k \texttt{)} {}^{\prime\prime} translates as “not just one of the x_j is true”.
  • In the Existential Interpretation (\mathrm{Ex}), where \texttt{o} = true and \texttt{|} = false,
    {}^{\backprime\backprime} \texttt{(} x_1 \texttt{,} \ldots \texttt{,} x_k \texttt{)} {}^{\prime\prime} translates as “just one of the x_j is not true”.

cc: FB | Logical GraphsLaws of FormMathstodonAcademia.edu
cc: Conceptual GraphsCyberneticsStructural ModelingSystems 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, 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 Operator Variables in Logical Graphs • 10

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

Leave a comment

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