Functional Logic • Inquiry and Analogy • Preliminaries
• https://inquiryintoinquiry.com/2023/06/20/functional-logic-inquiry-and-analogy-preliminaries-2/

Functional Logic • Inquiry and Analogy
• https://oeis.org/wiki/Functional_Logic_%E2%80%A2_Inquiry_and_Analogy

This report discusses C.S. Peirce's treatment of analogy, placing it in relation to his overall theory of inquiry. We begin by introducing three basic types of reasoning Peirce adopted from classical logic. In Peirce's analysis both inquiry and analogy are complex programs of logical inference which develop through stages of these three types, though normally in different orders.

Note on notation. The discussion to follow uses logical conjunctions, expressed in the form of concatenated tuples $e_1\dots e_k,$ and minimal negation operations, expressed in the form of bracketed tuples $\mathtt{\text{(}}{e}_1\mathtt{\text{,}}\dots \mathtt{\text{,}}{e}_k\mathtt{\text{)}},$ as the principal expression-forming operations of a calculus for boolean-valued functions, that is, for propositions. The expressions of this calculus parse into data structures whose underlying graphs are called “cacti” by graph theorists. Hence the name “cactus language” for this dialect of propositional calculus.

Resources —

Logic Syllabus
• https://oeis.org/wiki/Logic_Syllabus

Boolean Function
• https://oeis.org/wiki/Boolean_function

Boolean-Valued Function
• https://oeis.org/wiki/Boolean-valued_function

Logical Conjunction
• https://oeis.org/wiki/Logical_conjunction

Minimal Negation Operator
• https://oeis.org/wiki/Minimal_negation_operator

#Peirce #Logic #Abduction #Deduction #Induction #Analogy #Inquiry
#BooleanFunction #LogicalConjunction #MinimalNegationOperator
#LogicalGraph #CactusLanguage #PropositionalCalculus

Cactus Rules
• https://oeis.org/wiki/User:Jon_Awbrey/Cactus_Rules

With an eye toward the aims of the NKS Forum I've begun to work out a translation of the “elementary cellular automaton rules” (ECARs), in effect, just the boolean functions of abstract type $f:{\mathbb{B}}^3\to \mathbb{B},$ into cactus language, and I'll post a selection of my working notes here.

#Logic #LogicalGraphs #BooleanFunctions #PropositionalCalculus
#CactusCalculus #CactusLanguage #CactusSyntax #CellularAutomata

Logic Syllabus • Discussion 1
• https://inquiryintoinquiry.com/2023/06/02/logic-syllabus-discussion-1/

Re: Logic Syllabus ( https://inquiryintoinquiry.com/logic-syllabus/ )
Re: Laws of Form ( https://groups.io/g/lawsofform/topic/logic_syllabus/99218507 )
Re: John Mingers ( https://groups.io/g/lawsofform/message/2326 )

JM: ❝In a previous post you mentioned the minimal negation operator. Is there also the converse of this, i.e. an operator which is true when exactly one of its arguments is true? Or is this just XOR?❞

Yes, the “just one true” operator is a very handy tool. We discussed it earlier under the headings of “genus and species relations” or “radio button logic”. Viewed in the form of a venn diagram it describes a partition of the universe of discourse into mutually exclusive and exhaustive regions.

Reading $\mathtt{\text{(}}{x}_1\mathtt{\text{,}}\dots \mathtt{\text{,}}{x}_m\mathtt{\text{)}}$ to mean just one of $x_1,\dots ,x_m$ is false, the form $\mathtt{\text{((}}{x}_1\mathtt{\text{),}}\dots \mathtt{\text{,(}}{x}_m\mathtt{\text{))}}$ means just one of $x_1,\dots ,x_m$ is true.

For two logical variables, though, the cases “condense” or “degenerate” and saying “just one true” is the same thing as saying “just one false”.

$$\mathtt{\text{((}}{x}_1\mathtt{\text{),(}}{x}_2\mathtt{\text{))}}=\mathtt{\text{(}}{x}_1\mathtt{\text{,}}{x}_2\mathtt{\text{)}}=x_1+x_2=\mathrm{x}\mathrm{o}\mathrm{r}(x_1,x_2).$$

There's more information on the following pages.

Minimal Negation Operators
• https://oeis.org/wiki/Minimal_negation_operator

Related Truth Tables
• https://oeis.org/wiki/Minimal_negation_operator#Truth_tables

Genus, Species, Pie Charts, Radio Buttons
• https://inquiryintoinquiry.com/2021/11/10/genus-species-pie-charts-radio-buttons-1/

Related Discussions
• https://inquiryintoinquiry.com/?s=Radio+Buttons

#Logic #LogicSyllabus #BooleanDomain #BooleanFunction #BooleanValuedFunction
#Peirce #LogicalGraph #MinimalNegationOperator #ExclusiveDisjunction #XOR
#CactusLanguage #PropositionalCalculus #RadioButtonLogic #TruthTable

Inquiry Into Inquiry • Discussion 6
• https://inquiryintoinquiry.com/2023/04/30/inquiry-into-inquiry-discussion-6/

Re: Nicole Rust
• https://mathstodon.xyz/@NicoleCRust@neuromatch.social/110197230713039748

❝Computations or Processes —
How do you think about the building blocks of the brain?❞

I keep coming back to this thread about levels, along with others on the related issue of paradigms, as those have long been major questions for me. I am trying to clarify my current understanding for a blog post. It will start out a bit like this —

A certain amount of “level” language is natural in the sciences but “level” metaphors come with hidden assumptions about higher and lower places in hierarchies which don't always fit the case at hand. In complex cases what look at first like parallel strata may in time be better comprehended as intersecting domains or mutually recursive and entangled orders of being. When that happens we can guard against misleading imagery by speaking of domains or realms instead of levels.

To be continued …

#Peirce #Logic #LogicalGraphs #DifferentialLogic #CactusLanguage
#Inquiry #InquiryDrivenSystem #InquiryIntoInquiry #NeuralNetwork
#Semiotics #RelationTheory #SignRelation #TriadicRelation #Model
#ObjectiveReality #MathematicalStructure #SymbolicRepresentation

Theme One Program • Discussion 10
• https://inquiryintoinquiry.com/2023/04/17/theme-one-program-discussion-10/

Re: Seamus Bradley
• https://web.archive.org/web/20230422200222/https://mathstodon.xyz/@Scmbradley/110198310724722597

❝I thought of a programming language where every function can only return one type: the return type. The return type is just a wrapper around a struct that contains the actual return value, but also a reference to the called function and arguments, and possibly an error code.❞

My flashback —

Way back in the last millennium I started work on a programming style I called an “idea processor”, where an “idea” is a pointer to a “form” and a form is a minimal type of record containing 1 character, 1 number, and 4 more ideas.

I implemented a functional style where all the main functions are transformations of one or more ideas to a return idea. The principal data type is an “idea-form flag” which serves a role analogous to a “cons cell” in #Lisp.

Here's one entry point —

Theme One Program • Exposition 1
• https://inquiryintoinquiry.com/2022/06/15/theme-one-program-exposition-1-2/

#Peirce #Logic #LogicalGraphs #ThemeOneProgram #IdeaProcessor
#CactusLanguage #DeclarativeProgram #FunctionalProgramming

@mpiedrav

Cf. #CactusLanguage
• https://oeis.org/wiki/Cactus_Language_•_Overview

#MinimalNegationOperators
• https://oeis.org/wiki/Minimal_negation_operator

#Peirce #LogicalGraphs #MinimalNegations
#BooleanFunctions #PropositionalCalculus
#CactusGraphs #CactusLanguage #CactusSyntax

My new fav t-shirt.
Calico cat approves.
#caturday #catsofmastodon #cats #calicocats #CalicosAreMagic #cactus #CactusLanguage #hugs #freehugs

#DifferentialLogic • #SurveyPage
• https://inquiryintoinquiry.com/2022/11/20/survey-of-differential-logic-4/

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

#Logic
#LogicalGraphs
#CactusLanguage
#QualitativeDynamics
#PropositionalCalculus
#LogicalTransformations
#MinimalNegationOperators
#DiscreteDynamicalSystems
#TransformationsOfDiscourse
#DifferentialPropositionalCalculus
#DifferentialAnalyticTuringAutomata

Survey of #DifferentialLogic
• https://inquiryintoinquiry.com/2021/05/15/survey-of-differential-logic-3/

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

#Logic
#LogicalGraphs
#CactusLanguage
#PropositionalCalculus
#MinimalNegationOperators
#DiscreteDynamicalSystems
#DifferentialPropositionalCalculus
#DifferentialAnalyticTuringAutomata