#inquiryintoinquiry — Public Fediverse posts

Reflective Interpretive Frameworks • Incident 2
• https://inquiryintoinquiry.com/2026/08/27/reflective-interpretive-frameworks-incident-2/

Re: Terence Tao • Modular Arithmetic Challenge
• https://terrytao.wordpress.com/2026/06/08/modular-arithmetic-challenge/
• https://competition.sair.foundation/competitions/modular-arithmetic-challenge/overview

The Modular Arithmetic Challenge asks a simple question:

• Can a neural network learn to do modular multiplication efficiently?

Incidental Reflection 1 —

There are alternative models of neural networks which do not depend on threshold neurons and endlessly fiddling with weights.

Incidental Reflection 2 —

The series of three blog posts linked below present a case study comparing two ways of handling a classic example from the Parallel Distributed Processing paradigm, namely, the “Jets and Sharks” database problem, first taking up the original treatment by McClelland and Rumelhart and then proceeding according to a program I developed for propositional logic modeling. The latter method makes use of ideas from Grossberg's competition‑cooperation and winner‑take‑all dynamics, but is purely propositional‑logic based, involving no extraneous weights.

Theme One Program • Jets and Sharks
(1) https://inquiryintoinquiry.com/2024/06/20/theme-one-program-jets-and-sharks-1-a/
(2) https://inquiryintoinquiry.com/2024/06/22/theme-one-program-jets-and-sharks-2-a/
(3) https://inquiryintoinquiry.com/2024/06/23/theme-one-program-jets-and-sharks-3-a/

Resources —

Survey of Theme One Program
• https://inquiryintoinquiry.com/2025/05/06/survey-of-theme-one-program-7/

Differential Analytic Turing Automata
• https://oeis.org/wiki/Differential_Analytic_Turing_Automata_%E2%80%A2_Overview

#Peirce #HigherOrderSignRelations #Inquiry #InquiryIntoInquiry #Logic #Mathematics
#Recursion #Reflection #RelationTheory #Semiotics #SignRelations #TriadicRelations
#PropositionalModels #MinimalNegationOperators #DifferentialAnalyticTuringAutomata
#CactusGraphs #CactusLanguage #DifferentialLogic #NeuralNetworks #SequenceLearning

Reflective Interpretive Frameworks • Incident 2
• https://inquiryintoinquiry.com/2026/08/27/reflective-interpretive-frameworks-incident-2/

Re: Terence Tao • Modular Arithmetic Challenge
• https://terrytao.wordpress.com/2026/06/08/modular-arithmetic-challenge/
• https://competition.sair.foundation/competitions/modular-arithmetic-challenge/overview

The Modular Arithmetic Challenge asks a simple question:

• Can a neural network learn to do modular multiplication efficiently?

Incidental Reflection 1 —

There are alternative models of neural networks which do not depend on threshold neurons and endlessly fiddling with weights.

Incidental Reflection 2 —

The series of three blog posts linked below present a case study comparing two ways of handling a classic example from the Parallel Distributed Processing paradigm, namely, the “Jets and Sharks” database problem, first taking up the original treatment by McClelland and Rumelhart and then proceeding according to a program I developed for propositional logic modeling. The latter method makes use of ideas from Grossberg's competition‑cooperation and winner‑take‑all dynamics, but is purely propositional‑logic based, involving no extraneous weights.

Theme One Program • Jets and Sharks
(1) https://inquiryintoinquiry.com/2024/06/20/theme-one-program-jets-and-sharks-1-a/
(2) https://inquiryintoinquiry.com/2024/06/22/theme-one-program-jets-and-sharks-2-a/
(3) https://inquiryintoinquiry.com/2024/06/23/theme-one-program-jets-and-sharks-3-a/

Resources —

Survey of Theme One Program
• https://inquiryintoinquiry.com/2025/05/06/survey-of-theme-one-program-7/

Differential Analytic Turing Automata
• https://oeis.org/wiki/Differential_Analytic_Turing_Automata_%E2%80%A2_Overview

#Peirce #HigherOrderSignRelations #Inquiry #InquiryIntoInquiry #Logic #Mathematics
#Recursion #Reflection #RelationTheory #Semiotics #SignRelations #TriadicRelations
#PropositionalModels #MinimalNegationOperators #DifferentialAnalyticTuringAutomata
#CactusGraphs #CactusLanguage #DifferentialLogic #NeuralNetworks #SequenceLearning

Reflective Interpretive Frameworks • Incident 2
• https://inquiryintoinquiry.com/2026/08/27/reflective-interpretive-frameworks-incident-2/

Re: Terence Tao • Modular Arithmetic Challenge
• https://terrytao.wordpress.com/2026/06/08/modular-arithmetic-challenge/
• https://competition.sair.foundation/competitions/modular-arithmetic-challenge/overview

The Modular Arithmetic Challenge asks a simple question:

• Can a neural network learn to do modular multiplication efficiently?

Incidental Reflection 1 —

There are alternative models of neural networks which do not depend on threshold neurons and endlessly fiddling with weights.

Incidental Reflection 2 —

The series of three blog posts linked below present a case study comparing two ways of handling a classic example from the Parallel Distributed Processing paradigm, namely, the “Jets and Sharks” database problem, first taking up the original treatment by McClelland and Rumelhart and then proceeding according to a program I developed for propositional logic modeling. The latter method makes use of ideas from Grossberg's competition‑cooperation and winner‑take‑all dynamics, but is purely propositional‑logic based, involving no extraneous weights.

Theme One Program • Jets and Sharks
(1) https://inquiryintoinquiry.com/2024/06/20/theme-one-program-jets-and-sharks-1-a/
(2) https://inquiryintoinquiry.com/2024/06/22/theme-one-program-jets-and-sharks-2-a/
(3) https://inquiryintoinquiry.com/2024/06/23/theme-one-program-jets-and-sharks-3-a/

Resources —

Survey of Theme One Program
• https://inquiryintoinquiry.com/2025/05/06/survey-of-theme-one-program-7/

Differential Analytic Turing Automata
• https://oeis.org/wiki/Differential_Analytic_Turing_Automata_%E2%80%A2_Overview

#Peirce #HigherOrderSignRelations #Inquiry #InquiryIntoInquiry #Logic #Mathematics
#Recursion #Reflection #RelationTheory #Semiotics #SignRelations #TriadicRelations
#PropositionalModels #MinimalNegationOperators #DifferentialAnalyticTuringAutomata
#CactusGraphs #CactusLanguage #DifferentialLogic #NeuralNetworks #SequenceLearning

Reflective Interpretive Frameworks • Incident 2
• https://inquiryintoinquiry.com/2026/08/27/reflective-interpretive-frameworks-incident-2/

Re: Terence Tao • Modular Arithmetic Challenge
• https://terrytao.wordpress.com/2026/06/08/modular-arithmetic-challenge/
• https://competition.sair.foundation/competitions/modular-arithmetic-challenge/overview

The Modular Arithmetic Challenge asks a simple question:

• Can a neural network learn to do modular multiplication efficiently?

Incidental Reflection 1 —

There are alternative models of neural networks which do not depend on threshold neurons and endlessly fiddling with weights.

Incidental Reflection 2 —

The series of three blog posts linked below present a case study comparing two ways of handling a classic example from the Parallel Distributed Processing paradigm, namely, the “Jets and Sharks” database problem, first taking up the original treatment by McClelland and Rumelhart and then proceeding according to a program I developed for propositional logic modeling. The latter method makes use of ideas from Grossberg's competition‑cooperation and winner‑take‑all dynamics, but is purely propositional‑logic based, involving no extraneous weights.

Theme One Program • Jets and Sharks
(1) https://inquiryintoinquiry.com/2024/06/20/theme-one-program-jets-and-sharks-1-a/
(2) https://inquiryintoinquiry.com/2024/06/22/theme-one-program-jets-and-sharks-2-a/
(3) https://inquiryintoinquiry.com/2024/06/23/theme-one-program-jets-and-sharks-3-a/

Resources —

Survey of Theme One Program
• https://inquiryintoinquiry.com/2025/05/06/survey-of-theme-one-program-7/

Differential Analytic Turing Automata
• https://oeis.org/wiki/Differential_Analytic_Turing_Automata_%E2%80%A2_Overview

#Peirce #HigherOrderSignRelations #Inquiry #InquiryIntoInquiry #Logic #Mathematics
#Recursion #Reflection #RelationTheory #Semiotics #SignRelations #TriadicRelations
#PropositionalModels #MinimalNegationOperators #DifferentialAnalyticTuringAutomata
#CactusGraphs #CactusLanguage #DifferentialLogic #NeuralNetworks #SequenceLearning

Reflective Interpretive Frameworks • Incident 2
• https://inquiryintoinquiry.com/2026/08/27/reflective-interpretive-frameworks-incident-2/

Re: Terence Tao • Modular Arithmetic Challenge
• https://terrytao.wordpress.com/2026/06/08/modular-arithmetic-challenge/
• https://competition.sair.foundation/competitions/modular-arithmetic-challenge/overview

The Modular Arithmetic Challenge asks a simple question:

• Can a neural network learn to do modular multiplication efficiently?

Incidental Reflection 1 —

There are alternative models of neural networks which do not depend on threshold neurons and endlessly fiddling with weights.

Incidental Reflection 2 —

The series of three blog posts linked below present a case study comparing two ways of handling a classic example from the Parallel Distributed Processing paradigm, namely, the “Jets and Sharks” database problem, first taking up the original treatment by McClelland and Rumelhart and then proceeding according to a program I developed for propositional logic modeling. The latter method makes use of ideas from Grossberg's competition‑cooperation and winner‑take‑all dynamics, but is purely propositional‑logic based, involving no extraneous weights.

Theme One Program • Jets and Sharks
(1) https://inquiryintoinquiry.com/2024/06/20/theme-one-program-jets-and-sharks-1-a/
(2) https://inquiryintoinquiry.com/2024/06/22/theme-one-program-jets-and-sharks-2-a/
(3) https://inquiryintoinquiry.com/2024/06/23/theme-one-program-jets-and-sharks-3-a/

Resources —

Survey of Theme One Program
• https://inquiryintoinquiry.com/2025/05/06/survey-of-theme-one-program-7/

Differential Analytic Turing Automata
• https://oeis.org/wiki/Differential_Analytic_Turing_Automata_%E2%80%A2_Overview

#Peirce #HigherOrderSignRelations #Inquiry #InquiryIntoInquiry #Logic #Mathematics
#Recursion #Reflection #RelationTheory #Semiotics #SignRelations #TriadicRelations
#PropositionalModels #MinimalNegationOperators #DifferentialAnalyticTuringAutomata
#CactusGraphs #CactusLanguage #DifferentialLogic #NeuralNetworks #SequenceLearning

Reflection On Recursion • Discussion 1

Re: Reflection On Recursion • 1
Re: Laws of Form • John Mingers

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 under x‑rays 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 think to ask, “What is this that we call an interpreter?”, the pragmatic theory of signs tells us we do not know 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.

Everything I’ll be working at here will be done within a framework like that.

Regards,
Jon

Resources

• Inquiry Driven Systems • Inquiry Into Inquiry
• Reflective Interpretive Frameworks
• The Phenomenology of Reflection
• Higher Order Sign Relations

cc: Academia.edu • Cybernetics • Laws of Form • Mathstodon
cc: Research Gate • Structural Modeling • Systems Science • Syscoi

Reflection On Recursion • Discussion 1

Re: Reflection On Recursion • 1
Re: Laws of Form • John Mingers

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 under x‑rays 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 think to ask, “What is this that we call an interpreter?”, the pragmatic theory of signs tells us we do not know 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.

Everything I’ll be working at here will be done within a framework like that.

Regards,
Jon

Resources

• Inquiry Driven Systems • Inquiry Into Inquiry
• Reflective Interpretive Frameworks
• The Phenomenology of Reflection
• Higher Order Sign Relations

cc: Academia.edu • Cybernetics • Laws of Form • Mathstodon
cc: Research Gate • Structural Modeling • Systems Science • Syscoi

Reflection On Recursion • Discussion 1

Re: Reflection On Recursion • 1
Re: Laws of Form • John Mingers

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 under x‑rays 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 think to ask, “What is this that we call an interpreter?”, the pragmatic theory of signs tells us we do not know 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.

Everything I’ll be working at here will be done within a framework like that.

Regards,
Jon

Resources

• Inquiry Driven Systems • Inquiry Into Inquiry
• Reflective Interpretive Frameworks
• The Phenomenology of Reflection
• Higher Order Sign Relations

cc: Academia.edu • Cybernetics • Laws of Form • Mathstodon
cc: Research Gate • Structural Modeling • Systems Science • Syscoi

Reflection On Recursion • Discussion 1

Re: Reflection On Recursion • 1
Re: Laws of Form • John Mingers

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 under x‑rays 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 think to ask, “What is this that we call an interpreter?”, the pragmatic theory of signs tells us we do not know 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.

Everything I’ll be working at here will be done within a framework like that.

Regards,
Jon

Resources

• Inquiry Driven Systems • Inquiry Into Inquiry
• Reflective Interpretive Frameworks
• The Phenomenology of Reflection
• Higher Order Sign Relations

cc: Academia.edu • Cybernetics • Laws of Form • Mathstodon
cc: Research Gate • Structural Modeling • Systems Science • Syscoi

Reflection On Recursion • Discussion 1

Re: Reflection On Recursion • 1
Re: Laws of Form • John Mingers

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 under x‑rays 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 think to ask, “What is this that we call an interpreter?”, the pragmatic theory of signs tells us we do not know 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.

Everything I’ll be working at here will be done within a framework like that.

Regards,
Jon

Resources

• Inquiry Driven Systems • Inquiry Into Inquiry
• Reflective Interpretive Frameworks
• The Phenomenology of Reflection
• Higher Order Sign Relations

cc: Academia.edu • Cybernetics • Laws of Form • Mathstodon
cc: Research Gate • Structural Modeling • Systems Science • Syscoi

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 • 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 • 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 • 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 • 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 • 4

A feature of special note in the recursion diagram is the function traversing the square from one triadic node to the other.  It preserves an image of the object all the while its precedent 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.

Resources

• Inquiry Driven Systems • Inquiry Into Inquiry
• Reflective Interpretive Frameworks
• The Phenomenology of Reflection
• Higher Order Sign Relations

cc: Academia.edu • Cybernetics • Laws of Form • Mathstodon
cc: Research Gate • Structural Modeling • Systems Science • Syscoi

Reflection On Recursion • 4

A feature of special note in the recursion diagram is the function traversing the square from one triadic node to the other.  It preserves an image of the object all the while its precedent 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.

Resources

• Inquiry Driven Systems • Inquiry Into Inquiry
• Reflective Interpretive Frameworks
• The Phenomenology of Reflection
• Higher Order Sign Relations

cc: Academia.edu • Cybernetics • Laws of Form • Mathstodon
cc: Research Gate • Structural Modeling • Systems Science • Syscoi

Reflection On Recursion • 4

A feature of special note in the recursion diagram is the function traversing the square from one triadic node to the other.  It preserves an image of the object all the while its precedent 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.

Resources

• Inquiry Driven Systems • Inquiry Into Inquiry
• Reflective Interpretive Frameworks
• The Phenomenology of Reflection
• Higher Order Sign Relations

cc: Academia.edu • Cybernetics • Laws of Form • Mathstodon
cc: Research Gate • Structural Modeling • Systems Science • Syscoi

Reflection On Recursion • 4

A feature of special note in the recursion diagram is the function traversing the square from one triadic node to the other.  It preserves an image of the object all the while its precedent 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.

Resources

• Inquiry Driven Systems • Inquiry Into Inquiry
• Reflective Interpretive Frameworks
• The Phenomenology of Reflection
• Higher Order Sign Relations

cc: Academia.edu • Cybernetics • Laws of Form • Mathstodon
cc: Research Gate • Structural Modeling • Systems Science • Syscoi

Reflection On Recursion • 4

A feature of special note in the recursion diagram is the function traversing the square from one triadic node to the other.  It preserves an image of the object all the while its precedent 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.

Resources

• Inquiry Driven Systems • Inquiry Into Inquiry
• Reflective Interpretive Frameworks
• The Phenomenology of Reflection
• Higher Order Sign Relations

cc: Academia.edu • Cybernetics • Laws of Form • Mathstodon
cc: Research Gate • Structural Modeling • Systems Science • Syscoi

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 • 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 • 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 • 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 • 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