¿Shifting Paradigms? • 2

Re: Timothy Chow • Shifting Paradigms?

2014 Jul 31

I can’t remember when I first started playing with Gödel codings of graph-theoretic structures, which arose in logical and computational settings, but I remember being egged on in that direction by Martin Gardner’s 1976 column on Catalan numbers, planted plane trees, polygon dissections, etc.  Codings being injections from a combinatorial species S to integers, either non-negatives \mathbb{N} or positives \mathbb{M}, I was especially interested in codings that were also surjective, thereby revealing something about the target domain of arithmetic.

The most interesting bijection I found was one between positive integers \mathbb{M} and finite partial functions from \mathbb{M} to \mathbb{M}.  All of this comes straight out of the primes factorizations.  That type of bijection may remind some people of Dana Scott’s D_\infty.  Corresponding to the positive integers there arose two species of graphical structures, which I dubbed “riffs” and “rotes”.  See these links for more info:

The On-Line Encyclopedia of Integer Sequences (OEIS)

Jon Awbrey

An interesting tangent to the main subject, but one that I had some ready thoughts on.

Posted in Algebra, Arithmetic, Combinatorics, Foundations of Mathematics, Graph Theory, Group Theory, Inquiry, Logic, Mathematics, Model Theory, Number Theory, Paradigms, Peirce, Programming, Proof Theory, Riffs and Rotes | Tagged , , , , , , , , , , , , , , , | Leave a comment

¿Shifting Paradigms? • 1

Re: Dana Scott • Shifting Paradigms?

2014 Jul 28

This is very interesting to me, but not all my posts make it to the list, so I will spend a few days reflecting on it and post a comment on my blog, linked below. Thanks for the stimulating question.

Jon Awbrey

I’ve been trying to get back to this for over a week now, but there are times when all you can do is document the process, the flow of thought, no matter how slow it goes. So read my ellipsis … and watch this space  

Posted in Foundations of Mathematics, Inquiry, Logic, Mathematics, Model Theory, Paradigms, Peirce, Programming, Proof Theory | Tagged , , , , , , , , | Leave a comment

☯ Quantum Mechanics ☯

☯ Quantum Mechanics ☯

Posted in Photo, Quantum Mechanics | Tagged , | Leave a comment

Why is there so much falsity in the world?

Because people prefer falsity to truth, illusion to reality.

Being the drift of my reflections on the plays I saw at Stratford this summer —
King Lear, King John, Man of La Mancha, Alice Through the Looking-Glass,
Crazy for You, Hay Fever.

The Beaux’ Stratagem • Masks, Madness, & Sonnets • Antony and Cleopatra

Posted in Drama, Falsity, Illusion, Memoir, Question, Reality, Reflection, Shakespeare, The Big Picture, Theatre, Truth | Tagged , , , , , , , , , , | 9 Comments

Doubt, Uncertainty, Dispersion, Entropy • 2

Re: John BaezEntropy and Information in Biological Systems

  • To develop the concept of evolutionary games as “learning” processes in which information is gained over time.

A fund of ideas toward that end can be found in the work of C.S. Peirce on the themes of evolution, inquiry, and their interaction.  Peirce stands out as one of the few pioneers in the study of scientific method who avoided the dead‑ends of naive deductivisim and naive inductivisim.  He developed Aristotle’s concept of abductive reasoning in a way that anticipated later insights into the dynamics of paradigm shifts.  A question worth exploring in that connection is whether abductive hypothesis formation is to scientific method what random mutation is to natural selection.

Posted in Animata, C.S. Peirce, Cybernetics, Dispersion, Doubt, Entropy, Evolution, Information, Information Theory, Inquiry, Inquiry Driven Systems, Inquiry Into Inquiry, Learning Theory, Uncertainty | Tagged , , , , , , , , , , , , , | Leave a comment

Doubt, Uncertainty, Dispersion, Entropy • 1

Re: Peirce ListStephen Rose

Just a note to anchor a series of recurring thoughts that come to mind in relation to a Peirce List discussion of entropy etc., but I won’t have much to say on the bio-chemico-physico-thermo-dynamic side of things, so I’ll spin this off under a separate heading.  My interest in this topic arises mainly from my long-time work on inquiry driven systems (1)(2)(3)(4)(5)(6), where understanding the intertwined measures of uncertainty and information is critical to comprehending the dynamics of inquiry.

In a famous passage, Peirce says that inquiry begins with the “irritation of doubt” and ends when the irritation is soothed.  Here we find the same compound of affective and cognitive ingredients that we find in Aristotle’s original recipe for the sign relation.

When we view inquiry as a process taking place in a system the first thing we have to ask is what are the properties or variables that we need to consider in describing the state of the system at any given time.  Taking a Peircean perspective on a system capable of undergoing anything like an inquiry process, we are led to ask what are the conditions for the possibility of a system having “states of uncertainty” and “states of information” as state variables.

Posted in Animata, Aristotle, C.S. Peirce, Cybernetics, Differential Logic, Dispersion, Doubt, Entropy, Information, Inquiry, Inquiry Driven Systems, Inquiry Into Inquiry, Peirce, Semiotic Information, Semiotics, Sign Relations, Uncertainty | Tagged , , , , , , , , , , , , , , , , | Leave a comment

Peirce’s 1870 “Logic of Relatives” • Intermezzo

Peirce’s 1870 “Logic of Relatives”

Update • 10 April 2022

This brings me to the end of the notes on Peirce’s 1870 Logic of Relatives I began posting to the web in various discussion groups a dozen (now a score) years ago.  Apart from that there are only the assorted notes and bits of discussion with other people I archived on the InterSciWiki talk page linked here.

I rushed through my last few comments a little too hastily, giving no more than sketches of proofs for Peirce’s logical formulas, and I won’t be reasonably well convinced of them until I examine a few more concrete examples and develop one or two independent lines of proof.  So I have that much unfinished business to do before moving on to the rest of Peirce’s paper.

But I’ll take a few days to catch my breath, rummage through those old notes of mine to see if they hide any hints worth salvaging, and then start fresh, raveling out the rest of Peirce’s clues to the maze of logical relatives.

References

  • Peirce, C.S. (1870), “Description of a Notation for the Logic of Relatives, Resulting from an Amplification of the Conceptions of Boole’s Calculus of Logic”, Memoirs of the American Academy of Arts and Sciences 9, 317–378, 26 January 1870.  Reprinted, Collected Papers 3.45–149, Chronological Edition 2, 359–429.  Online (1) (2) (3).
  • Peirce, C.S., Collected Papers of Charles Sanders Peirce, vols. 1–6, Charles Hartshorne and Paul Weiss (eds.), vols. 7–8, Arthur W. Burks (ed.), Harvard University Press, Cambridge, MA, 1931–1935, 1958.
  • Peirce, C.S., Writings of Charles S. Peirce : A Chronological Edition, Peirce Edition Project (eds.), Indiana University Press, Bloomington and Indianapolis, IN, 1981–.

Resources

cc: CyberneticsOntolog ForumStructural ModelingSystems Science
cc: FB | Peirce MattersLaws of Form • Peirce List (1) (2) (3) (4) (5) (6) (7)

Posted in C.S. Peirce, Logic, Logic of Relatives, Logical Graphs, Mathematics, Relation Theory, Visualization | Tagged , , , , , , | 12 Comments

Peirce’s 1870 “Logic of Relatives” • Comment 12.5

Peirce’s 1870 “Logic of Relatives”Comment 12.5

The equation (\mathit{s}^\mathit{l})^\mathrm{w} = \mathit{s}^{\mathit{l}\mathrm{w}} can be verified by establishing the corresponding equation in matrices.

(\mathsf{S}^\mathsf{L})^\mathsf{W} ~=~ \mathsf{S}^{\mathsf{L}\mathsf{W}}

If \mathsf{A} and \mathsf{B} are two 1-dimensional matrices over the same index set X then \mathsf{A} = \mathsf{B} if and only if \mathsf{A}_x = \mathsf{B}_x for every x \in X.  Thus, a routine way to check the validity of (\mathsf{S}^\mathsf{L})^\mathsf{W} = \mathsf{S}^{\mathsf{L}\mathsf{W}} is to check whether the following equation holds for arbitrary x \in X.

((\mathsf{S}^\mathsf{L})^\mathsf{W})_x ~=~ (\mathsf{S}^{\mathsf{L}\mathsf{W}})_x

Taking both ends toward the middle, we proceed as follows.

Matrix Equation ((S^L)^W)_X = (S^(LW))_X

The products commute, so the equation holds.  In essence, the matrix identity turns on the fact that the law of exponents (a^b)^c = a^{bc} in ordinary arithmetic holds when the values a, b, c are restricted to the boolean domain \mathbb{B} = \{ 0, 1 \}.  Interpreted as a logical statement, the law of exponents (a^b)^c = a^{bc} amounts to a theorem of propositional calculus otherwise expressed in the following ways.

\begin{matrix}  (a \Leftarrow b) \Leftarrow c & = & a \Leftarrow b \land c  \\[8pt]  c \Rightarrow (b \Rightarrow a) & = & c \land b \Rightarrow a  \end{matrix}

Resources

cc: CyberneticsOntolog ForumStructural ModelingSystems Science
cc: FB | Peirce MattersLaws of Form • Peirce List (1) (2) (3) (4) (5) (6) (7)

Posted in C.S. Peirce, Logic, Logic of Relatives, Logical Graphs, Mathematics, Relation Theory, Visualization | Tagged , , , , , , | 13 Comments

Peirce’s 1870 “Logic of Relatives” • Comment 12.4

Peirce’s 1870 “Logic of Relatives”Comment 12.4

Peirce next considers a pair of compound involutions, stating an equation between them analogous to a law of exponents from ordinary arithmetic, namely,  (a^b)^c = a^{bc}.

Then (\mathit{s}^\mathit{l})^\mathrm{w} will denote whatever stands to every woman in the relation of servant of every lover of hers;  and \mathit{s}^{(\mathit{l}\mathrm{w})} will denote whatever is a servant of everything that is lover of a woman.  So that

(s^ℓ)^w = s^(ℓw)

(Peirce, CP 3.77)

Articulating the compound relative term \mathit{s}^{(\mathit{l}\mathrm{w})} in set-theoretic terms is fairly immediate.

Denotation Equation s^(ℓw)

On the other hand, translating the compound relative term (\mathit{s}^\mathit{l})^\mathrm{w} into its set-theoretic equivalent is less immediate, the hang-up being we have yet to define the case of logical involution raising one dyadic relative term to the power of another.  As a result, it looks easier to proceed through the matrix representation, drawing once again on the inspection of a concrete example.

Involution Example 2

Consider a universe of discourse X subject to the following data.

\begin{array}{*{15}{c}}  X & = & \{ & a, & b, & c, & d, & e, & f, & g, & h, & i\ & \}  \\[6pt]  L & = & \{ & b\!:\!a, & b\!:\!c, & c\!:\!b, & c\!:\!d, & e\!:\!d, & e\!:\!e, & e\!:\!f, & g\!:\!f, & g\!:\!h, & h\!:\!g, & h\!:\!i & \}  \\[6pt]  S & = & \{ & b\!:\!a, & b\!:\!c, & d\!:\!c, & d\!:\!d, & d\!:\!e, & f\!:\!e, & f\!:\!f, & f\!:\!g, & h\!:\!g, & h\!:\!i\ & \}  \end{array}

Bigraph Involution S^L
\text{Figure 56. Bigraph Involution}~ \mathsf{S}^\mathsf{L}

There is a “servant of every lover of” link between u and v if and only if u \cdot S ~\supseteq~ L \cdot v.  But the vacuous inclusions, that is, the cases where L \cdot v = \varnothing, have the effect of adding non‑intuitive links to the mix.

The computational requirements are evidently met by the following formula.

Matrix Computation S^L

In other words, (\mathsf{S}^\mathsf{L})_{xy} = 0 if and only if there exists a p \in X such that \mathsf{S}_{xp} = 0 and \mathsf{L}_{py} = 1.

Resources

cc: CyberneticsOntolog ForumStructural ModelingSystems Science
cc: FB | Peirce MattersLaws of Form • Peirce List (1) (2) (3) (4) (5) (6) (7)

Posted in C.S. Peirce, Logic, Logic of Relatives, Logical Graphs, Mathematics, Relation Theory, Visualization | Tagged , , , , , , | 12 Comments

Peirce’s 1870 “Logic of Relatives” • Comment 12.3

Peirce’s 1870 “Logic of Relatives”Comment 12.3

We now have two ways of computing a logical involution raising a dyadic relative term to the power of a monadic absolute term, for example, \mathit{l}^\mathrm{w} for “lover of every woman”.

The first method applies set-theoretic operations to the extensions of absolute and relative terms, expressing the denotation of the term \mathit{l}^\mathrm{w} as the intersection of a set of relational applications.

Denotation Equation L^W

The second method operates in the matrix representation, expressing the value of the matrix \mathsf{L}^\mathsf{W} at an argument u as a product of coefficient powers.

Matrix Computation L^W

Abstract formulas like these are more easily grasped with the aid of a concrete example and a picture of the relations involved.

Involution Example 1

Consider a universe of discourse X subject to the following data.

\begin{array}{*{15}{c}}  X & = & \{ & a, & b, & c, & d, & e, & f, & g, & h, & i & \}  \\[6pt]  W & = & \{ & d, & f & \}  \\[6pt]  L & = & \{ & b\!:\!a, & b\!:\!c, & c\!:\!b, & c\!:\!d, & e\!:\!d, & e\!:\!e, & e\!:\!f, & g\!:\!f, & g\!:\!h, & h\!:\!g, & h\!:\!i & \}  \end{array}

Figure 55 shows the placement of W within X and the placement of L within X \times X.

Bigraph Involution L^W
\text{Figure 55. Bigraph Involution}~ \mathsf{L}^\mathsf{W}

To highlight the role of W more clearly, the Figure represents the absolute term ``\mathrm{w}" by means of the relative term ``\mathrm{w},\!" which conveys the same information.

Computing the denotation of \mathit{l}^\mathrm{w} by way of the class intersection formula, we can show our work as follows.

Class Intersection L^W

With the above Figure in mind, we can visualize the computation of \textstyle (\mathsf{L}^\mathsf{W})_u = \prod_{v \in X} \mathsf{L}_{uv}^{\mathsf{W}_v} as follows.

  1. Pick a specific u in the bottom row of the Figure.
  2. Pan across the elements v in the middle row of the Figure.
  3. If u links to v then \mathsf{L}_{uv} = 1, otherwise \mathsf{L}_{uv} = 0.
  4. If v in the middle row links to v in the top row then \mathsf{W}_v = 1, otherwise \mathsf{W}_v = 0.
  5. Compute the value \mathsf{L}_{uv}^{\mathsf{W}_v} = (\mathsf{L}_{uv} \Leftarrow \mathsf{W}_v) for each v in the middle row.
  6. If any of the values \mathsf{L}_{uv}^{\mathsf{W}_v} is 0 then the product \textstyle \prod_{v \in X} \mathsf{L}_{uv}^{\mathsf{W}_v} is 0, otherwise it is 1.

As a general observation, we know the value of (\mathsf{L}^\mathsf{W})_u goes to 0 just as soon as we find a v \in X such that \mathsf{L}_{uv} = 0 and \mathsf{W}_v = 1, in other words, such that (u, v) \notin L but v \in W.  If there is no such v then (\mathsf{L}^\mathsf{W})_u = 1.

Running through the program for each u \in X, the only case producing a non-zero result is (\mathsf{L}^\mathsf{W})_e = 1.  That portion of the work can be sketched as follows.

Matrix Coefficient L^W

Resources

cc: CyberneticsOntolog ForumStructural ModelingSystems Science
cc: FB | Peirce MattersLaws of Form • Peirce List (1) (2) (3) (4) (5) (6) (7)

Posted in C.S. Peirce, Logic, Logic of Relatives, Logical Graphs, Mathematics, Relation Theory, Visualization | Tagged , , , , , , | 11 Comments