12,080
edits
Changes
MyWikiBiz, Author Your Legacy — Sunday June 16, 2024
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Functional Logic : Inquiry and Analogy (view source)
Revision as of 18:34, 30 October 2009
, 18:34, 30 October 2009→Abstract: + note on notation
This report discusses C.S. Peirce's treatment of analogy, placing it in relation to his overall theory of inquiry. The first order of business is to introduce the three fundamental types of reasoning that Peirce adopted from classical logic. In Peirce's analysis both inquiry and analogy are complex programs of reasoning that develop through stages of these three types, although normally in different orders.
This report discusses C.S. Peirce's treatment of analogy, placing it in relation to his overall theory of inquiry. The first order of business is to introduce the three fundamental types of reasoning that Peirce adopted from classical logic. In Peirce's analysis both inquiry and analogy are complex programs of reasoning that develop through stages of these three types, although normally in different orders.
'''Note on notation.''' The discussion that follows uses [[minimal negation operations]], expressed as bracketed tuples of the form <math>\texttt{(} e_1 \texttt{,} \ldots \texttt{,} e_k \texttt{)},</math> and logical conjunctions, expressed as concatenated tuples of the form <math>e_1 ~\ldots~ e_k,</math> as the sole expression-forming operations of a calculus for [[boolean-valued functions]] or "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.
<div class="nonumtoc">__TOC__</div>
<div class="nonumtoc">__TOC__</div>
