Differential Propositional Calculus • 2

Cactus Calculus

Table 6 outlines a syntax for propositional calculus based on two types of logical connectives, both of variable k-ary scope.

  • A bracketed sequence of propositional expressions \texttt{(} e_1 \texttt{,} e_2 \texttt{,} \ldots \texttt{,} e_{k-1} \texttt{,} e_k \texttt{)} is taken to mean exactly one of the propositions e_1, e_2, \ldots, e_{k-1}, e_k is false, in other words, their minimal negation is true.
  • A concatenated sequence of propositional expressions e_1 ~ e_2 ~ \ldots ~ e_{k-1} ~ e_k is taken to mean every one of the propositions e_1, e_2, \ldots, e_{k-1}, e_k is true, in other words, their logical conjunction is true.

\text{Table 6. Syntax and Semantics of a Calculus for Propositional Logic}
Syntax and Semantics of a Calculus for Propositional Logic

All other propositional connectives can be obtained through combinations of the above two forms.  Strictly speaking, the concatenation form is dispensable in light of the bracket form, but it is convenient to maintain it as an abbreviation for more complicated bracket expressions.  While working with expressions solely in propositional calculus, it is easiest to use plain parentheses for logical connectives.  In contexts where parentheses are needed for other purposes “teletype” parentheses \texttt{(} \ldots \texttt{)} or barred parentheses (\!| \ldots |\!) may be used for logical operators.

The briefest expression for logical truth is the empty word, abstractly denoted \boldsymbol\varepsilon or \boldsymbol\lambda in formal languages, where it forms the identity element for concatenation.  It may be given visible expression in this context by means of the logically equivalent form \texttt{((} ~ \texttt{))}, or, especially if operating in an algebraic context, by a simple 1.  Also when working in an algebraic mode, the plus sign {+} may be used for exclusive disjunction.  For example, we have the following paraphrases of algebraic expressions:

\begin{matrix}  x + y ~=~ \texttt{(} x \texttt{,} y \texttt{)}  \\[6pt]  x + y + z ~=~ \texttt{((} x \texttt{,} y \texttt{),} z \texttt{)} ~=~ \texttt{(} x \texttt{,(} y \texttt{,} z \texttt{))}  \end{matrix}

It is important to note the last expressions are not equivalent to the triple bracket \texttt{(} x \texttt{,} y \texttt{,} z \texttt{)}.

Resources

cc: Cybernetics • Ontolog Forum • Peirce List • Structural Modeling • Systems Science

Posted in Amphecks, Boolean Functions, C.S. Peirce, Cactus Graphs, Category Theory, Change, Computational Complexity, Cybernetics, Differential Analytic Turing Automata, Differential Calculus, Differential Logic, Discrete Dynamics, Dynamical Systems, Equational Inference, Functional Logic, Gradient Descent, Graph Theory, Group Theory, Hologrammautomaton, Indicator Functions, Logic, Logical Graphs, Mathematical Models, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Time, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 4 Comments

Differential Propositional Calculus • 1

A differential propositional calculus is a propositional calculus extended by a set of terms for describing aspects of change and difference, for example, processes taking place in a universe of discourse or transformations mapping a source universe to a target universe.

Casual Introduction

Consider the situation represented by the venn diagram in Figure 1.

Figure 1. Local Habitations, And Names
\text{Figure 1. Local Habitations, And Names}

The area of the rectangle represents a universe of discourse, X.  The universe under discussion may be a population of individuals having various additional properties or it may be a collection of locations occupied by various individuals.  The area of the “circle” represents the individuals having the property q or the locations in the corresponding region Q.  Four individuals, a, b, c, d, are singled out by name.  It happens that b and c currently reside in region Q while a and d do not.

Now consider the situation represented by the venn diagram in Figure 2.

Figure 2. Same Names, Different Habitations
\text{Figure 2. Same Names, Different Habitations}

Figure 2 differs from Figure 1 solely in the circumstance that the object c is outside the region Q while the object d is inside the region Q.  So far, nothing says our encountering these Figures in this order is other than purely accidental but if we interpret this sequence of frames as a “moving picture” representation of their natural order in a temporal process then it would be natural to suppose a and b have remained as they were with regard to the quality q while c and d have changed their standings in that respect.  In particular, c has moved from the region where q is true to the region where q is false while d has moved from the region where q is false to the region where q is true.

Figure 3 returns to the situation in Figure 1, but this time interpolates a new quality specifically tailored to account for the relation between Figure 1 and Figure 2.

Figure 3. Back, To The Future
\text{Figure 3. Back, To The Future}

This new quality, \mathrm{d}q, is an example of a differential quality, since its absence or presence qualifies the absence or presence of change occurring in another quality.  As with any other quality, it is represented in the venn diagram by means of a “circle” distinguishing two halves of the universe of discourse, in this case, the portions of X outside and inside the region \mathrm{d}Q.

Figure 1 represents a universe of discourse, X, together with a basis of discussion, \{ q \}, for expressing propositions about the contents of that universe.  Once the quality q is given a name, say, the symbol ``q", we have the basis for a formal language specifically cut out for discussing X in terms of q.  This language is more formally known as the propositional calculus with alphabet \{ ``q" \}.

In the context marked by X and \{ q \} there are just four distinct pieces of information which can be expressed in the corresponding propositional calculus, namely, the constant proposition \text{false}, the negative proposition \lnot q, the positive proposition q, and the constant proposition \text{true}.

For example, referring to the points in Figure 1, the constant proposition \text{false} holds of no points, the negative proposition \lnot q holds of a and d, the positive proposition q holds of b and c, and the constant proposition \text{true} holds of all points in the sample.

Figure 3 extends the basis of description for the space X to a set of two qualities \{q, \mathrm{d}q\} and the corresponding terms of description to an alphabet of two symbols \{``q", ``\mathrm{d}q"\}.

Any propositional calculus over two basic propositions allows for the expression of sixteen propositions all together.  Salient among those propositions in the present setting are the four which single out the individual sample points at the initial moment of observation.  Table 4 lists the initial state descriptions, using overlines to express logical negations.

\text{Table 4. Initial State Descriptions}

Initial State Descriptions

Table 5 shows the rules of inference responsible for giving the differential quality \mathrm{d}q its meaning in practice.

\text{Table 5. Differential Inference Rules}

Differential Inference Rules

Resources

cc: Cybernetics • Ontolog Forum • Peirce List • Structural Modeling • Systems Science

Posted in Amphecks, Boolean Functions, C.S. Peirce, Cactus Graphs, Category Theory, Change, Computational Complexity, Cybernetics, Differential Analytic Turing Automata, Differential Calculus, Differential Logic, Discrete Dynamics, Dynamical Systems, Equational Inference, Functional Logic, Gradient Descent, Graph Theory, Group Theory, Hologrammautomaton, Indicator Functions, Logic, Logical Graphs, Mathematical Models, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Time, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 4 Comments

Differential Propositional Calculus • Overview

The most fundamental concept in cybernetics is that of “difference”, either that two things are recognisably different or that one thing has changed with time.

W. Ross Ashby • An Introduction to Cybernetics

Here’s the outline of a sketch I wrote on differential propositional calculi, which extend propositional calculi by adding terms for describing aspects of change and difference, for example, processes taking place in a universe of discourse or transformations mapping a source universe to a target universe.  I wrote this as an intuitive introduction to differential logic, which is my best effort so far at dealing with the ancient and persistent problems of treating diversity and mutability in logical terms.  I’ll be looking at ways to improve this draft as I serialize it to my blog.

Part 1

Casual Introduction

Cactus Calculus

Part 2

Formal_Development

Elementary Notions

Special Classes of Propositions

Linear Propositions

Positive Propositions

Singular Propositions

Differential Extensions

Appendices

Appendices

Appendix 1. Propositional Forms and Differential Expansions

Table A1. Propositional Forms on Two Variables

Table A2. Propositional Forms on Two Variables

Table A3. Ef Expanded Over Differential Features

Table A4. Df Expanded Over Differential Features

Table A5. Ef Expanded Over Ordinary Features

Table A6. Df Expanded Over Ordinary Features

Appendix 2. Differential Forms

Table A7. Differential Forms Expanded on a Logical Basis

Table A8. Differential Forms Expanded on an Algebraic Basis

Table A9. Tangent Proposition as Pointwise Linear Approximation

Table A10. Taylor Series Expansion Df = df + d²f

Table A11. Partial Differentials and Relative Differentials

Table A12. Detail of Calculation for the Difference Map

Appendix 3. Computational Details

Operator Maps for the Logical Conjunction f8(u, v)

Computation of εf8
Computation of Ef8
Computation of Df8
Computation of df8
Computation of rf8
Computation Summary for Conjunction

Operator Maps for the Logical Equality f9(u, v)

Computation of εf9
Computation of Ef9
Computation of Df9
Computation of df9
Computation of rf9
Computation Summary for Equality

Operator Maps for the Logical Implication f11(u, v)

Computation of εf11
Computation of Ef11
Computation of Df11
Computation of df11
Computation of rf11
Computation Summary for Implication

Operator Maps for the Logical Disjunction f14(u, v)

Computation of εf14
Computation of Ef14
Computation of Df14
Computation of df14
Computation of rf14
Computation Summary for Disjunction

Appendix 4. Source Materials

Appendix 5. Various Definitions of the Tangent Vector

References

References

cc: Cybernetics • Laws of Form • Ontolog Forum • Peirce List (1) (2)
cc: FB | Differential Logic • Structural Modeling • Systems Science

Posted in Amphecks, Boolean Functions, C.S. Peirce, Cactus Graphs, Category Theory, Change, Computational Complexity, Cybernetics, Differential Analytic Turing Automata, Differential Calculus, Differential Logic, Discrete Dynamics, Dynamical Systems, Equational Inference, Functional Logic, Gradient Descent, Graph Theory, Group Theory, Hologrammautomaton, Indicator Functions, Logic, Logical Graphs, Mathematical Models, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Time, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 10 Comments

Survey of Differential Logic • 2

This is a Survey of blog and wiki posts on Differential Logic, material I plan to develop toward a more compact and systematic account.

Elements

Blog Series

Architectonics

Applications

Blog Dialogs

Explorations

Posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Category Theory, Change, Cybernetics, Differential Analytic Turing Automata, Differential Calculus, Differential Logic, Discrete Dynamics, Equational Inference, Frankl Conjecture, Functional Logic, Gradient Descent, Graph Theory, Hologrammautomaton, Indicator Functions, Inquiry Driven Systems, Leibniz, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Surveys, Time, Topology, Visualization, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 5 Comments

Pragmatic Semiotic Information • Discussion 19

Re: Differential Logic and Dynamic Systems
Re: FB | Systems Sciences • Kenneth Lloyd

An exchange on Facebook took me back to recent discussions of pragmatic truth and long-running discussions of pragmatic semiotic information.  Just by way of a note to myself and anyone who’s interested, I’ll copy my comment here and add a few links to keep the relevant gray cells warm.

Concepts of belief, fact, knowledge, opinion, etc. look rather different from a Peircean pragmatic perspective, in other words, when analyzed in terms of the pragmatic maxim.  In time the traditional conceptions begin to strike us as increasingly clumsy tools, better supplanted by Peirce’s concept of information.

Resources

cc: Cybernetics • Ontolog Forum • Structural Modeling • Systems Science

Posted in Abduction, Aristotle, C.S. Peirce, Comprehension, Deduction, Definition, Determination, Extension, Hypothesis, Induction, Inference, Information, Information = Comprehension × Extension, Inquiry, Intension, Intention, Logic, Logic of Science, Mathematics, Measurement, Observation, Peirce, Perception, Phenomenology, Physics, Pragmatic Semiotic Information, Pragmatism, Probability, Quantum Mechanics, Scientific Method, Semiotics, Sign Relations | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 7 Comments

Cybernetics • Requisite Variety • Selection 13

Our venture into cybernetics, the study of systems whose time evolution signifies an object, brings us to the point of seeing how pragmatic, semiotic, and systems thinking all have triadic relations at their core.

Recall the game between R and D determined by the following data:

Ashby Cybernetics Table 11.3.1

We continue with Ashby’s analysis of how the game plays out.

Requisite Variety

11/3.[cont.]   Examination of the table soon shows that with this particular table R can win always.  Whatever value D selects first, R can always select a Greek letter that will give the desired outcome.  Thus if D selects 1, R selects \beta;  if D selects 2, R selects \alpha;  and so on.  In fact, if R acts according to the transformation

Ashby Cybernetics Figure 11.3.2

then he can always force the outcome to be a.

R\text{'s} position, with this particular table, is peculiarly favourable, for not only can R always force a as the outcome, but he can as readily force, if desired, b or c as the outcome.  R has, in fact, complete control of the outcome.

Reference

  • Ashby, W.R. (1956), An Introduction to Cybernetics, Chapman and Hall, London, UK.  Republished by Methuen and Company, London, UK, 1964.  Online.

cc: Cybernetics • Ontolog Forum • Structural Modeling • Systems Science

Posted in Adaptive Systems, Ashby, C.S. Peirce, Communication, Control, Cybernetics, Evolution, Information, Inquiry Driven Systems, Learning, Logic, Mathematics, Peirce, Purpose, Regulation, Survival, Truth Theory, W. Ross Ashby | Tagged , , , , , , , , , , , , , , , , , | 9 Comments

Cybernetics • Requisite Variety • Selection 12

Ashby now invites us to consider a series of games, beginning as follows.

Requisite Variety

11/3.   Play and outcome.  Let us therefore forget all about regulation and simply suppose that we are watching two players, R and D, who are engaged in a game.  We shall follow the fortunes of R, who is attempting to score an a.  The rules are as follows.  They have before them Table 11/3/1, which can be seen by both:

Ashby Cybernetics Table 11.3.1

D must play first, by selecting a number, and thus a particular row.  R, knowing this number, then selects a Greek letter, and thus a particular column.  The italic letter specified by the intersection of the row and column is the outcome.  If it is an a, R wins;  if not, R loses.

I’ll pause the play here and give readers a chance to contemplate strategies.

Reference

  • Ashby, W.R. (1956), An Introduction to Cybernetics, Chapman and Hall, London, UK.  Republished by Methuen and Company, London, UK, 1964.  Online.

cc: Cybernetics • Ontolog Forum • Structural Modeling • Systems Science

Posted in Adaptive Systems, Ashby, C.S. Peirce, Communication, Control, Cybernetics, Evolution, Information, Inquiry Driven Systems, Learning, Logic, Mathematics, Peirce, Purpose, Regulation, Survival, Truth Theory, W. Ross Ashby | Tagged , , , , , , , , , , , , , , , , , | 6 Comments

Pragmatic Truth • Discussion 21

Re: Cybernetic Communications • Klaus Krippendorff

I appreciate the way Klaus Krippendorff immediately extracted one of the overarching themes of Peirce’s whole paper, indeed of his whole work.  That allows us to tread lightly past a lot of verbal nit-picking about the differences among traditional concepts like belief, fact, knowledge, opinion, etc. and get right down to systems-theoretic ideas about states of information and inquiry as a process that revises those states.

Here’s a bit I wrote a few years back rubricizing Peirce’s four ways of moving from doubt to belief — from a state of information so unsettled it puzzles the will to one secure enough on which to act, should the need for action arise.

My favorite polymathematician, Charles Sanders Peirce, gave a fourfold classification of what he called “methods of fixing belief”, or “settling opinion”, most notably and seminally in his paper, “The Fixation of Belief” (1877).  Adjusting his nomenclature very slightly, if only for the sake of preserving a mnemonic rhyme scheme, we may refer to his four types as Tenacity, Authority, Plausibility (à priori pleasing praiseworthiness), and full-fledged Scientific Inquiry.

Reference

Resources

cc: Cybernetics • Ontolog • Peirce List (1) (2) • Structural Modeling • Systems Science

Posted in Aristotle, C.S. Peirce, Coherence, Concordance, Congruence, Consensus, Convergence, Correspondence, Dewey, Fixation of Belief, Information, Inquiry, John Dewey, Kant, Logic, Logic of Science, Method, Peirce, Philosophy, Pragmatic Maxim, Pragmatism, Semiotics, Sign Relations, Triadic Relations, Truth, Truth Theory, William James | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 8 Comments

Pragmatic Truth • Discussion 20

Re: Renaissance Mathematicus • Thony Christie
Re: Cybernetic Communications • Louis Kauffman
Re: FB | Charles S. Peirce Society • John Corcoran

Various conceptions of belief in relation to pragmatic theories of inquiry, signs, and truth have come up recently in several discussion groups.  Some of the variations are too far off my present track but if I stay the pragmatic course I’d naturally recommend the novel fork taken by Peirce’s 1877 paper, “The Fixation of Belief”.

Resources

cc: Cybernetics • Ontolog • Peirce List (1) (2) • Structural Modeling • Systems Science

Posted in Aristotle, C.S. Peirce, Coherence, Concordance, Congruence, Consensus, Convergence, Correspondence, Dewey, Fixation of Belief, Information, Inquiry, John Dewey, Kant, Logic, Logic of Science, Method, Peirce, Philosophy, Pragmatic Maxim, Pragmatism, Semiotics, Sign Relations, Triadic Relations, Truth, Truth Theory, William James | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 5 Comments

Differential Logic • Comment 4

Re: Cybernetic Communications • Stephen Paul King

SPK:
Is it possible that beliefs can propagate almost completely contrary to facts, seen by those that are not infected with those beliefs?
Can we have complex waves in the domains of binary truth tables?

Dear Stephen,

Patterns of change in multi-dimensional Boolean spaces is what Differential Logic is all about.  I’ll say more on that as I get time but here’s a collection of resource links for now.

Resources

cc: Cybernetics • Laws of Form • Ontolog Forum • Peirce List
cc: FB | Differential Logic • Structural Modeling • Systems Science

Posted in Adaptive Systems, Amphecks, Belief Systems, Boole, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Cybernetics, Differential Logic, Discrete Dynamics, Fixation of Belief, Gradient Descent, Graph Theory, Hill Climbing, Hologrammautomaton, Inquiry, Inquiry Driven Systems, Laws of Form, Leibniz, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Optimization, Painted Cacti, Peirce, Propositional Calculus, Spencer Brown | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Comments Off on Differential Logic • Comment 4