Interpreter and Interpretant • Selection 2

A idea of what Peirce means by an Interpretant and the part it plays in a triadic sign relation is given by the following passage.

It is clearly indispensable to start with an accurate and broad analysis of the nature of a Sign.  I define a Sign as anything which is so determined by something else, called its Object, and so determines an effect upon a person, which effect I call its Interpretant, that the latter is thereby mediately determined by the former.  My insertion of “upon a person” is a sop to Cerberus, because I despair of making my own broader conception understood.  (Peirce 1908, Selected Writings, p. 404).

According to his custom of clarifying ideas in terms of their effects, Peirce tells us what a sign is in terms of what it does, the effect it brings to bear on a “person”.  That effect he calls the interpretant of the sign.  And what of that person?  Peirce finesses that question for the moment, resorting to a “Sop to Cerberus”, in other words, a rhetorical gambit used to side‑step a persistent difficulty of exposition.  In doing so, Peirce invokes the hypostatic abstraction of a “person” who conducts the movement of signs and embodies the ongoing process of semiosis.

Reference

  • Peirce, C.S. (1908), “Letters to Lady Welby”, Chapter 24, pp. 380–432 in Charles S. Peirce : Selected Writings (Values in a Universe of Chance), Edited with Introduction and Notes by Philip P. Wiener, Dover Publications, New York, NY, 1966.

Resources

cc: Academia.eduBlueSkyLaws of FormMathstodonResearch Gate
cc: Conceptual GraphsCyberneticsStructural ModelingSystems Science

Posted in C.S. Peirce, Hermeneutics, Interpretation, Interpretive Frameworks, Logic, Logical Graphs, Objective Frameworks, Relation Theory, Semiotics, Sign Relations, Triadic Relations, Visualization | Tagged , , , , , , , , , , , | 4 Comments

Interpreter and Interpretant • Selection 1

Questions about the relationship between “interpreters” and “interpretants” in Peircean semiotics have broken out again.  To put the matter as pointedly as possible — because I know someone or other is bound to — “In a theory of three‑place relations among objects, signs, and interpretant signs, where indeed is there any place for the interpretive agent?”

By way of getting my feet on the ground with the issue I’ll do what has always helped me before and review a small set of basic texts.  Here is the first.

Sign Relation in Aristotle
\text{Figure 1. The Sign Relation in Aristotle}

Words spoken are symbols or signs (symbola) of affections or impressions (pathemata) of the soul (psyche);  written words are the signs of words spoken.  As writing, so also is speech not the same for all races of men.  But the mental affections themselves, of which these words are primarily signs (semeia), are the same for the whole of mankind, as are also the objects (pragmata) of which those affections are representations or likenesses, images, copies (homoiomata).  (Aristotle, De Interp. i. 16a4).

References

  • Aristotle, “On Interpretation” (De Interp.), Harold P. Cooke (trans.), pp. 111–179 in Aristotle, Volume 1, Loeb Classical Library, William Heinemann, London, UK, 1938.
  • Awbrey, J.L., and Awbrey, S.M. (1995), “Interpretation as Action : The Risk of Inquiry”, Inquiry : Critical Thinking Across the Disciplines 15(1), 40–52.  ArchiveJournal.  Online (doc) (pdf).

Resources

cc: Academia.eduBlueSkyLaws of FormMathstodonResearch Gate
cc: Conceptual GraphsCyberneticsStructural ModelingSystems Science

Posted in C.S. Peirce, Hermeneutics, Interpretation, Interpretive Frameworks, Logic, Logical Graphs, Objective Frameworks, Relation Theory, Semiotics, Sign Relations, Triadic Relations, Visualization | Tagged , , , , , , , , , , , | 4 Comments

Riffs and Rotes • Happy New Year 2025

\text{Let} ~ p_n = \text{the} ~ n^\text{th} ~ \text{prime}.

\text{Then} ~ 2025  = 81 \cdot 25  = 3^4 5^2  = {p_2}^4 {p_3}^2  = {p_2}^{{p_1}^{p_1}} {p_3}^{p_1}  = {p_{p_1}}^{{p_1}^{p_1}} {p_{p_2}}^{p_1}  = {p_{p_1}}^{{p_1}^{p_1}} {p_{p_{p_1}}}^{p_1}

No information is lost by dropping the terminal 1s.  Thus we may write the following form.

2025 = {p_p}^{p^p} {p_{p_p}}^p

The article linked below tells how forms of that sort correspond to a family of digraphs called riffs and a family of graphs called rotes.  The riff and rote for 2025 are shown in the next two Figures.

Riff 2025

Riff 2025

Rote 2025

Rote 2025

Reference

cc: Academia.eduCyberneticsStructural ModelingSystems Science
cc: Conceptual GraphsLaws of FormMathstodonResearch Gate

Posted in Algebra, Arithmetic, Combinatorics, Computation, Graph Theory, Group Theory, Logic, Mathematics, Number Theory, Recursion, Representation, Riffs and Rotes, Semiotics, Visualization | Tagged , , , , , , , , , , , , , | Leave a comment

Differential Propositional Calculus • 37

Foreshadowing Transformations • Extensions and Projections of Discourse

And, despite the care which she took to look behind her at every moment, she failed to see a shadow which followed her like her own shadow, which stopped when she stopped, which started again when she did, and which made no more noise than a well‑conducted shadow should.

— Gaston Leroux • The Phantom of the Opera

Many times in our discussion we have occasion to place one universe of discourse in the context of a larger universe of discourse.  An embedding of the type [\mathcal{X}] \to [\mathcal{Y}] is implied any time we make use of one basis \mathcal{X} which happens to be included in another basis \mathcal{Y}.  When discussing differential relations we usually have in mind the extended alphabet \mathfrak{Y} has a special construction or a specific lexical relation with respect to the initial alphabet \mathfrak{X}, one which is marked by characteristic types of accents, indices, or inflected forms.

Resources

cc: Academia.eduCyberneticsStructural ModelingSystems Science
cc: Conceptual GraphsLaws of FormMathstodonResearch Gate

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, Functional Logic, Graph Theory, Hologrammautomaton, Indicator Functions, Inquiry Driven Systems, Leibniz, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Propositional Calculus, Time, Topology, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , | 3 Comments

Differential Propositional Calculus • 36

Transformations of Discourse

It is understandable that an engineer should be completely absorbed in his speciality, instead of pouring himself out into the freedom and vastness of the world of thought, even though his machines are being sent off to the ends of the earth;  for he no more needs to be capable of applying to his own personal soul what is daring and new in the soul of his subject than a machine is in fact capable of applying to itself the differential calculus on which it is based.  The same thing cannot, however, be said about mathematics;  for here we have the new method of thought, pure intellect, the very well‑spring of the times, the fons et origo of an unfathomable transformation.

— Robert Musil • The Man Without Qualities

Here we take up the general study of logical transformations, or maps relating one universe of discourse to another.  In many ways, and especially as applied to the subject of intelligent dynamic systems, the argument will develop the antithesis of the statement just quoted.  Along the way, if incidental to my ends, I hope the present essay can pose a fittingly irenic epitaph to the frankly ironic epigraph inscribed at its head.

The goal is to answer a single question:  What is a propositional tangent functor?  In other words, the aim is to develop a clear conception of what manner of thing would pass in the logical realm for a genuine analogue of the tangent functor, an object conceived to generalize as far as possible in the abstract terms of category theory the ordinary notions of functional differentiation and the all too familiar operations of taking derivatives.

As a first step we examine the types of transformations we already know as extensions and projections and we use their special cases to illustrate several styles of logical and visual representation which figure in the sequel.

Resources

cc: Academia.eduCyberneticsStructural ModelingSystems Science
cc: Conceptual GraphsLaws of FormMathstodonResearch Gate

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, Functional Logic, Graph Theory, Hologrammautomaton, Indicator Functions, Inquiry Driven Systems, Leibniz, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Propositional Calculus, Time, Topology, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , | 3 Comments

Differential Propositional Calculus • 35

Example 2. Drives and Their Vicissitudes (concl.)

Applied to the example of 4^\text{th}‑gear curves, the indexing scheme results in the data of the next two Tables, showing one period for each orbit.

Fourth Gear Orbits 1 and 2

The states in each orbit are listed as ordered pairs (p_i, q_j), where p_i may be read as a temporal parameter indicating the present time of the state and where j is the decimal equivalent of the binary numeral s.

Grasped more intuitively, the Tables show each state q_s with a subscript s equal to the numerator of its rational index, taking for granted the constant denominator 2^4 = 16.  In that way the temporal succession of states can be reckoned by a parallel round‑up rule.  Namely, if (d_k, d_{k+1}) is any pair of adjacent digits in the state index r then the value of d_k in the next state is {d_k}^\prime = d_k + d_{k+1}.

Resources

cc: Academia.eduCyberneticsStructural ModelingSystems Science
cc: Conceptual GraphsLaws of FormMathstodonResearch Gate

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, Functional Logic, Graph Theory, Hologrammautomaton, Indicator Functions, Inquiry Driven Systems, Leibniz, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Propositional Calculus, Time, Topology, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , | 4 Comments

Differential Propositional Calculus • 34

Example 2. Drives and Their Vicissitudes (cont.)

With a little thought it is possible to devise a canonical indexing scheme for the states in differential logical systems.  A scheme of that order allows for comparing changes of state in universes of discourse that weigh in on different scales of observation.

To that purpose, let us index the states q \in \mathrm{E}^m X with the dyadic rationals (or the binary fractions) in the half-open interval [0, 2).  Formally and canonically, a state q_r is indexed by a fraction r = \tfrac{s}{t} whose denominator is the power of two t = 2^m and whose numerator is a binary numeral formed from the coefficients of state in a manner to be described next.

The differential coefficients of the state q are the values \mathrm{d}^k\!A(q) for k = 0 ~\text{to}~ m, where \mathrm{d}^0\!A is defined as identical to A.  To form the binary index d_0.d_1 \ldots d_m of the state q the coefficient \mathrm{d}^k\!A(q) is read off as the binary digit d_k associated with the place value 2^{-k}.  Expressed in algebraic terms, the rational index r of the state q is given by the following equivalent formulations.

Differential Coefficients • State Coordinates

Resources

cc: Academia.eduCyberneticsStructural ModelingSystems Science
cc: Conceptual GraphsLaws of FormMathstodonResearch Gate

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, Functional Logic, Graph Theory, Hologrammautomaton, Indicator Functions, Inquiry Driven Systems, Leibniz, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Propositional Calculus, Time, Topology, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , | 3 Comments

Differential Propositional Calculus • 33

Example 2. Drives and Their Vicissitudes (cont.)

Expressed in the language of drives and gears our next Example may be described as the family of fourth‑gear curves through the fourth extension \mathrm{E}^4 X = \langle A, ~\mathrm{d}A, ~\mathrm{d}^2\!A, ~\mathrm{d}^3\!A, ~\mathrm{d}^4\!A \rangle.  Those are the trajectories generated subject to the dynamic law \mathrm{d}^4 A = 1, where it’s understood all higher order differences are equal to 0.

Because \mathrm{d}^4 A and all higher differences \mathrm{d}^k A are fixed, the state vectors vary only with respect to their projections as points of \mathrm{E}^3 X = \langle A, ~\mathrm{d}A, ~\mathrm{d}^2\!A, ~\mathrm{d}^3\!A \rangle.  Thus there is just enough space in a planar venn diagram to plot the orbits and show how they partition the points of \mathrm{E}^3 X.  It turns out there are just two possible orbits, of eight points each, as shown in the following Figure.

Example 2. Fourth Gear Orbits
\text{Example 2. Fourth Gear Orbits}

Resources

cc: Academia.eduCyberneticsStructural ModelingSystems Science
cc: Conceptual GraphsLaws of FormMathstodonResearch Gate

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, Functional Logic, Graph Theory, Hologrammautomaton, Indicator Functions, Inquiry Driven Systems, Leibniz, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Propositional Calculus, Time, Topology, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , | 4 Comments

Differential Propositional Calculus • 32


I open my scuttle at night and see the far‑sprinkled systems,
And all I see, multiplied as high as I can cipher, edge but
     the rim of the farther systems.

— Walt Whitman • Leaves of Grass

Example 2. Drives and Their Vicissitudes

Before we leave the one‑feature case let’s look at a more substantial example, one which illustrates a general class of curves through the extended feature spaces and affords an opportunity to discuss important themes concerning their structure and dynamics.

As before let \mathcal{X} = \{ x_1 \} = \{ A \}.  The discussion to follow considers a class of trajectories having the property that \mathrm{d}^k A = 0 for all k greater than a fixed value m and indulges in the use of a picturesque vocabulary to describe salient classes of those curves.

Given the above finite order condition, there is a highest order non‑zero difference \mathrm{d}^m A exhibited at each point of any trajectory one may consider.  With respect to any point of the corresponding curve let us call that highest order differential feature \mathrm{d}^m A the drive at that point.  Curves of constant drive \mathrm{d}^m A are then referred to as m^\text{th}gear curves.

  • Note.  The fact that a difference calculus can be developed for boolean functions is well known and was probably familiar to Boole, who was an expert in difference equations before he turned to logic.  And of course there is the strange but true story of how the Turin machines of the 1840s prefigured the Turing machines of the 1940s.  At the very outset of general purpose mechanized computing we find the motive power driving the Analytical Engine of Babbage, the kernel of an idea behind all of his wheels, was exactly his notion that difference operations, suitably trained, can serve as universal joints for any conceivable computation.

Resources

cc: Academia.eduCyberneticsStructural ModelingSystems Science
cc: Conceptual GraphsLaws of FormMathstodonResearch Gate

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, Functional Logic, Graph Theory, Hologrammautomaton, Indicator Functions, Inquiry Driven Systems, Leibniz, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Propositional Calculus, Time, Topology, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , | 3 Comments

Differential Propositional Calculus • 31

Tacit Extensions

Returning to the Table of Differential Propositions, let’s examine how the general concept of a tacit extension applies to the differential extension of a one‑dimensional universe of discourse, where \mathcal{X} = \{ A \} and \mathcal{Y} = \mathrm{E}\mathcal{X} = \{ A, \mathrm{d}A \}.

Each proposition f_i : X \to \mathbb{B} has a canonical expression e_i in the set \{ 0, \texttt{(} A \texttt{)}, A, 1 \}.  The tacit extension \boldsymbol\varepsilon f_i : \mathrm{E}X \to \mathbb{B} may then be expressed as a logical conjunction f_i = e_i \cdot \tau, where \tau is a logical tautology using all the variables in \mathcal{Y} - \mathcal{X}.  The following Table shows how the tacit extensions \boldsymbol\varepsilon f_i of the propositions f_i may be expressed in terms of the extended basis \{ A, \mathrm{d}A \}.

\text{Tacit Extension of}~ [A] ~\text{to}~ [A, \mathrm{d}A]
Tacit Extension of [A] to [A, dA]

In its bearing on the singular propositions over a universe of discourse X the above analysis has an interesting interpretation.  The tacit extension takes us from thinking about a particular state, like A or \texttt{(} A \texttt{)}, to considering the collection of outcomes, the outgoing changes or singular dispositions springing or stemming from that state.

Resources

cc: Academia.eduCyberneticsStructural ModelingSystems Science
cc: Conceptual GraphsLaws of FormMathstodonResearch Gate

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, Functional Logic, Graph Theory, Hologrammautomaton, Indicator Functions, Inquiry Driven Systems, Leibniz, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Propositional Calculus, Time, Topology, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , | 3 Comments