Language Learning And Logical Modeling —

Wrote my first “Language Learning Module”, strictly speaking, a two‑level formal language learner, back in the 80s and it pretty much told me what every conceivable upscale of that ilk would be like. But it did not cross the threshold of logical reasoning, so I used Peirce's logical graphs for that. Et sic deinceps …

#Peirce #Logic #Mathematics #Semiotics #LogicalGraphs
#LanguageLearningAlgorithm #LogicalModelingAlgorithm

Animated Logical Graphs • 2
• https://inquiryintoinquiry.com/2015/01/14/animated-logical-graphs-2/

It's almost 50 years now since I first encountered the volumes of Peirce's “Collected Papers” in the math library at Michigan State, and shortly afterwards a friend called my attention to the entry for Spencer Brown's “Laws of Form” in the Whole Earth Catalog and I sent off for it right away. I would spend the next decade just beginning to figure out what either one of them was talking about in the matter of logical graphs and I would spend another decade after that developing a program, first in Lisp and then in Pascal, that turned graph‑theoretic data structures formed on their ideas to good purpose as the basis of its reasoning engine.

I thought it might contribute to a number of long‑running and ongoing discussions if I could articulate what I think I learned from that experience.

So I'll try to keep focused on that.

Resources —

Logical Graphs • First Impressions
• https://inquiryintoinquiry.com/2024/08/26/logical-graphs-first-impressions-a/

Logical Graphs • Formal Development
• https://inquiryintoinquiry.com/2024/09/12/logical-graphs-formal-development-b/

Survey of Animated Logical Graphs
• https://inquiryintoinquiry.com/2025/05/02/survey-of-animated-logical-graphs-8/

#Peirce #Logic #Mathematics #Semiotics #LogicalGraphs #GraphTheory
#SpencerBrown #LawsOfForm #PropositionalCalculus #ProofAnimations

Animated Logical Graphs • 1
• https://inquiryintoinquiry.com/2015/01/08/animated-logical-graphs-1/

For Your Musement …

Here are some animations I made up to illustrate several different styles of proof in an extended topological variant of Peirce's Alpha Graphs for propositional logic.

Proof Animations
• https://oeis.org/wiki/User:Jon_Awbrey/ANIMATION#Proof_Animations

Double Negation
• https://inquiryintoinquiry.com/wp-content/uploads/2026/04/proof-animation-e280a2-double-negation-2.0.gif

Peirce's Law
• https://inquiryintoinquiry.com/wp-content/uploads/2026/04/proof-animation-e280a2-peirces-law-2.0.gif

Praeclarum Theorema
• https://inquiryintoinquiry.com/wp-content/uploads/2026/04/proof-animation-e280a2-praeclarum-theorema-2.0.gif

Two‑Thirds Majority Function
• https://inquiryintoinquiry.com/wp-content/uploads/2026/04/proof-animation-e280a2-two-thirds-majority-function-2.0.gif

A full discussion of logical graphs can be found in the following article.

Logical Graphs
• https://oeis.org/wiki/Logical_Graphs

Resources —

Logical Graphs • First Impressions
• https://inquiryintoinquiry.com/2024/08/26/logical-graphs-first-impressions-a/

Logical Graphs • Formal Development
• https://inquiryintoinquiry.com/2024/09/12/logical-graphs-formal-development-b/

Survey of Animated Logical Graphs
• https://inquiryintoinquiry.com/2025/05/02/survey-of-animated-logical-graphs-8/

cc: https://www.academia.edu/community/ldzadj
cc: https://mathstodon.xyz/@Inquiry/116494097283214718
cc: https://www.researchgate.net/post/Animated_Logical_Graphs
cc: https://stream.syscoi.com/2026/04/30/animated-logical-graphs-1/
cc: https://groups.io/g/lawsofform/topic/animated_logical_graphs/119049814

#Peirce #Logic #Mathematics #Semiotics #LogicalGraphs #GraphTheory
#SpencerBrown #LawsOfForm #PropositionalCalculus #ProofAnimations

Animated Logical Graphs • 1
• https://inquiryintoinquiry.com/2015/01/08/animated-logical-graphs-1/

For Your Musement …

Here are some animations I made up to illustrate several different styles of proof in an extended topological variant of Peirce’s Alpha Graphs for propositional logic.

Proof Animations
• https://oeis.org/wiki/User:Jon_Awbrey/ANIMATION#Proof_Animations

See the following article for a full discussion of this type of logical graph.

Logical Graphs
• https://oeis.org/wiki/Logical_Graphs

Additional Resources —

Logical Graphs • First Impressions
• https://inquiryintoinquiry.com/2024/08/26/logical-graphs-first-impressions-a/

Logical Graphs • Formal Development
• https://inquiryintoinquiry.com/2024/09/12/logical-graphs-formal-development-b/

#Peirce #Logic #Mathematics #Semiotics #LogicalGraphs #GraphTheory
#SpencerBrown #LawsOfForm #PropositionalCalculus #ProofAnimations

Reflection On Recursion • Discussion 1
• https://inquiryintoinquiry.com/2026/04/21/reflection-on-recursion-discussion-1/

Re: Reflection On Recursion • 1
• https://inquiryintoinquiry.com/2026/04/06/reflection-on-recursion-1/
Re: Laws of Form • John Mingers
• https://groups.io/g/lawsofform/message/4943

JM:
❝This is a very important and interesting topic. I think you should consider the relationship to self‑reference, indeed are they really the same thing?

❝Also the work of Maturana and Varela on autopoiesis and the neurophysiology of cognition which also has recursion at its heart.❞

Thanks, John. Yes, we certainly find the whole array of self concepts coming into play here — selfhood, autopoiesis or self creation, self reference and self transformation, just to name a few. But one thing I need to emphasize from the start is how radically different such concepts appear when viewed in the x‑ray vision of Peirce’s pragmatic semiotics.

I forget where I first heard it, but it’s fairly common observation that the persistence of a recurring problem is a symptom of how unlikely it is to be solved in the paradigm where it keeps occurring.

After a while, it simply becomes time to change the paradigm …

Just by way of a first example, take the very idea of “self‑reference”. The moment we place it in the medium of triadic sign relations we realize signs do not refer to anything at all except insofar as an interpreter refers them.

And when we ask, “What is this, that we call an interpreter?”, the pragmatic theory of signs tells us we cannot tell when we turn out the light but under the x‑ray of the pragmatic maxim the sum of its effects is effectively modeled by an extended triadic sign relation.

Et sic deinceps …

#Peirce #Logic #Mathematics
#Recursion #Reflection #Semiotics
#SignRelations #TriadicRelations

Reflection On Recursion • 4
• https://inquiryintoinquiry.com/2026/04/18/reflection-on-recursion-4/

A feature worth noting in the recursion diagram is the function traversing the square from one triadic node to the other. It preserves an image of the object n all the while its precedent p(n) is being retrieved and processed — thus it injects a measure of parallel process and a modicum of extra memory over and above that afforded by the serial composition of functions.

Simple Recursion
• https://inquiryintoinquiry.com/wp-content/uploads/2026/03/simple-recursion-fn-mn-fpn.png

Resources —

Inquiry Driven Systems • Inquiry Into Inquiry
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Overview

Reflective Interpretive Frameworks
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Part_10#RIF_1

The Phenomenology of Reflection
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Part_11#The_Phenomenology_of_Reflection

Higher Order Sign Relations
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Part_12#Higher_Order_Sign_Relations

#Peirce #HigherOrderSignRelations #Inquiry #InquiryIntoInquiry #Logic #Mathematics
#Recursion #Reflection #RelationTheory #Semiotics #SignRelations #TriadicRelations

Reflection On Recursion • 3
• https://inquiryintoinquiry.com/2026/04/13/reflection-on-recursion-3/

One other feature of syntactic recursion deserves to be brought into higher relief. Evidence of it can be found in the recursion diagram by examining the places where three paths meet. On the descending side there is the point where three paths diverge. On the ascending side there is the point where the middlemost of the three divergent paths joins the upshot arrow in medias res.

Simple Recursion
• https://inquiryintoinquiry.com/wp-content/uploads/2026/03/simple-recursion-fn-mn-fpn.png

The arrows of the diagram represent functions, a species of dyadic relations, but nodes of degree three signify aspects of triadic relations somewhere in the mix.

• The three arrows from the initial node represent a function F : N → N×N×N such that F(n) = (p(n), n, f(n)).

• The three arrows at the penultimate node represent a function m : N×N → N such that m(j, k) = jk.

For the sake of a first approach, many questions about triadic relations which might arise at this point can be safely left to later discussions, since the current level of generality is comprehensible enough in functional terms.

Resources —

Inquiry Driven Systems • Inquiry Into Inquiry
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Overview

Reflective Interpretive Frameworks
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Part_10#RIF_1

The Phenomenology of Reflection
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Part_11#The_Phenomenology_of_Reflection

Higher Order Sign Relations
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Part_12#Higher_Order_Sign_Relations

#Peirce #HigherOrderSignRelations #Inquiry #InquiryIntoInquiry #Logic #Mathematics
#Recursion #Reflection #RelationTheory #Semiotics #SignRelations #TriadicRelations

Reflection On Recursion • 2
• https://inquiryintoinquiry.com/2026/04/09/reflection-on-recursion-2/

Turning to the form of a simple recursive function f(n) = m(n, f(p(n))), the clause we used to define it earns the title of “syntactic recursion” due to the way the function name “f” occurring in the defined phrase “f(n)” re‑occurs in the defining phrase “m(n, f(p(n)))”.

Simple Recursion
• https://inquiryintoinquiry.com/wp-content/uploads/2026/03/simple-recursion-fn-mn-fpn.png

It needs to be clear there is no circle in the definition — each instance of the type f is defined in terms of an instance one step simpler until the base case is reached and fixed by fiat. Instead of a circle then we have two gyres, the gyre down via the precedent function p and the gyre up via the modifier function m.

cc: https://www.academia.edu/community/L24rvm
cc: https://www.academia.edu/community/LE2mrr
cc: https://www.researchgate.net/post/Reflection_On_Recursion

#Peirce #HigherOrderSignRelations #Inquiry #InquiryIntoInquiry #Logic #Mathematics
#Recursion #Reflection #RelationTheory #Semiotics #SignRelations #TriadicRelations

Reflection On Recursion • 1.3
• https://inquiryintoinquiry.com/2026/04/06/reflection-on-recursion-1/

Comment 5 —

Recursion is rife in mathematics and computation, typically sporting its recursive character on its sleeve in the fashion of syntax sketched above.

But mathematics and computation are overlearned subjects and practices, enjoying long histories of being gone over with an eye to articulating every last detail of any way they might be conceived and conducted.

So it's fair to ask whether all that artifice truly tutors nature or only creates a rationalized reconstruction of it. Then again, even if that's all it does, is there anything of use to be learned from it?

Comment 6 —

The prevalence of recursion in mathematics arises from the architecture of mathematical systems.

Mathematical systems grow from a fourfold root.

• “Primitives” are taken as initial terms.

• “Definitions” expound ever more complex terms in relation to the primitives.

• “Axioms” are taken as initial truths.

• “Theorems” follow from the axioms by way of inference rules.

Recursive definitions of mathematical objects and inductive proofs of the corresponding theorems follow closely parallel patterns. And again, in computation, recursive programs follow the same patterns in action.

#Peirce #HigherOrderSignRelations #Inquiry #InquiryIntoInquiry #Logic #Mathematics
#Recursion #Reflection #RelationTheory #Semiotics #SignRelations #TriadicRelations

Reflection On Recursion • 1.2
• https://inquiryintoinquiry.com/2026/04/06/reflection-on-recursion-1/

Comment 3 —

If we discard from the idea of recursion what is not of its essence, we find recursion occurs when our understanding of one situation has recourse to our understanding of other situations.

Very typically, the object situation presents itself as complex, difficult, or unfamiliar while the resource situations are regarded as being better understood.

It must be appreciated, however, that any ranking of situations by level of understanding is contingent on the circumstances in view and may vary radically in alternate settings.

Comment 4 —

Recursion occurs more markedly in “syntactic recursion”, where the recursive process shows its character as such in the symbols of its syntactic expression.

A sense of the difference can be gained by looking at a case of “ostensible syntactic recursion”. (How much substance backs the ostentation is a subject we'll take up, maybe at length, but later …)

Consider the following diagram for the computation of a simple recursive function.

Simple Recursion
• https://inquiryintoinquiry.com/wp-content/uploads/2026/03/simple-recursion-fn-mn-fpn.png

For example, the factorial function f(n) = n! has a definition in terms of the predecessor function p(n) = n-1 and the multiplier function m(j, k) = j∙k.

#Peirce #HigherOrderSignRelations #Inquiry #InquiryIntoInquiry #Logic #Mathematics
#Recursion #Reflection #RelationTheory #Semiotics #SignRelations #TriadicRelations