Functional Logic • Inquiry and Analogy

Skip to first unread message

Jon Awbrey

Nov 14, 2021, 2:56:15 PMNov 14
to Cybernetic Communications, Laws of Form, Ontolog Forum, Peirce List, Structural Modeling, SysSciWG
Cf: Functional Logic • Inquiry and Analogy • Preliminaries


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, although normally in different orders.

Note on notation. The discussion to follow uses logical conjunctions, expressed in
the form of concatenated tuples e₁ … eₖ, and minimal negation operations, expressed in
the form of bracketed tuples (e₁, …, eₖ), 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.


• Logic Syllabus ( )
• Boolean Function ( )
• Boolean-Valued Function ( )
• Logical Conjunction ( )
• Minimal Negation Operator ( )


Reply all
Reply to author
0 new messages