Functional Logic • Inquiry and Analogy • Preliminaries
• https://inquiryintoinquiry.com/2021/11/14/functional-logic-inquiry-and-analogy-preliminaries/

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 \ldots e_k,\) and minimal negation operations, expressed in the form of bracketed tuples \(\texttt{(} e_1 \texttt{,} \ldots \texttt{,} e_k \texttt{)},\) 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

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 )
❝_❞ John Mingers ( https://groups.io/g/lawsofform/message/2326 )

❝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 as a venn diagram it describes a partition of the universe of discourse into mutually exclusive and exhaustive regions.

Reading \(\texttt{(} x_1 \texttt{,} \ldots \texttt{,} x_m \texttt{)}\) to mean just one of \(x_1, \ldots, x_m\) is false, the form \(\texttt{((} x_1 \texttt{),} \ldots \texttt{,(} x_m \texttt{))}\) means just one of \(x_1, \ldots, 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”.

\[\texttt{((} x_1 \texttt{),(} x_2 \texttt{))} = \texttt{(} x_1 \texttt{,} x_2 \texttt{)} = x_1 + x_2 = \textsc{xor} (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

Logic Syllabus • 3
• https://inquiryintoinquiry.com/logic-syllabus/

Logical Concepts
• https://oeis.org/wiki/Logic_Syllabus#Logical_concepts

Ampheck • https://oeis.org/wiki/Ampheck
Boolean Domain • https://oeis.org/wiki/Boolean_domain
Boolean Function • https://oeis.org/wiki/Boolean_function
Boolean-Valued Function • https://oeis.org/wiki/Boolean-valued_function
Differential Logic • https://oeis.org/wiki/Differential_logic
Logical Graph • https://oeis.org/wiki/Logical_Graphs
Minimal Negation Operator • https://oeis.org/wiki/Minimal_negation_operator
Multigrade Operator • https://oeis.org/wiki/Multigrade_operator
Parametric Operator • https://oeis.org/wiki/Parametric_operator
Peirce's Law • https://oeis.org/wiki/Peirce%27s_law
Propositional Calculus • https://oeis.org/wiki/Propositional_calculus
Sole Sufficient Operator • https://oeis.org/wiki/Sole_sufficient_operator
Truth Table • https://oeis.org/wiki/Truth_table
Universe of Discourse • https://oeis.org/wiki/Universe_of_discourse
Zeroth Order Logic • https://oeis.org/wiki/Zeroth_order_logic

#Logic #LogicSyllabus #Ampheck #BooleanDomain #BooleanFunction #BooleanValuedFunction
#DifferentialLogic #LogicalGraph #MinimalNegationOperator #MultigradeOperator
#ParametricOperator #PeircesLaw #PropositionalCalculus #SoleSufficientOperator
#TruthTable #UniverseOfDiscourse #ZerothOrderLogic

#LogicalGraphs • 1
• https://oeis.org/w/index.php?title=Logical_Graphs&stable=0&redirect=no

A #LogicalGraph is a graph-theoretic structure in one of the systems of graphical syntax Charles Sanders #Peirce developed for #Logic.

In his papers on #QualitativeLogic, #EntitativeGraphs, and #ExistentialGraphs, Peirce developed several versions of a graphical formalism, or a graph-theoretic formal language, designed to be interpreted for logic.

#PropositionalCalculus #BooleanFunctions
#GraphTheory #ModelTheory #ProofTheory

#AllLiarNoParadox
• https://inquiryintoinquiry.com/2015/08/01/all-liar-no-paradox/

A statement \(S_0\) asserts that a statement \(S_1\) is a statement that \(S_1\) is false.

The statement \(S_0\) violates an #AxiomOfLogic, so it doesn’t really matter whether the #OstensibleStatement \(S_1,\) the so-called #Liar, really is a statement or has a #TruthValue.

#Logic #LogicalAxiom #LawOfLogic #LogicalGraph
#LiarParadox #Epimenides #EpimenidesParadox