[CG] Re: Functional Logic • Inquiry and Analogy

Functional Logic • Inquiry and Analogy • 6 • https://inquiryintoinquiry.com/2023/06/26/functional-logic-inquiry-and-anal… Inquiry and Analogy • Peirce's Formulation of Analogy • Version 1 • https://oeis.org/wiki/Functional_Logic_%E2%80%A2_Inquiry_and_Analogy#Peirce… All, Next we look at a couple of ways Peirce analyzed analogical inferences. Version 1 — <QUOTE CSP:> C.S. Peirce • “On the Natural Classification of Arguments” (1867) The formula of analogy is as follows: S′, S″, and S‴ are taken at random from such a class that their characters at random are such as P′, P″, P‴. T is P′, P″, P‴, S′, S″, S‴ are Q; ∴ T is Q. Such an argument is double. It combines the two following: 1. S′, S″, S‴ are taken as being P′, P″, P‴, S′, S″, S‴ are Q; ∴ (By induction) P′, P″, P‴ is Q, T is P′, P″, P‴; ∴ (Deductively) T is Q. 2. S′, S″, S‴ are, for instance, P′, P″, P‴, T is P′, P″, P‴; ∴ (By hypothesis) T has the common characters of S′, S″, S‴, S′, S″, S‴ are Q; ∴ (Deductively) T is Q. Owing to its double character, analogy is very strong with only a moderate number of instances. (Peirce, CP 2.513, CE 2, 46–47) </QUOTE> Figure 7 shows the logical relationships involved in the above analysis. Figure 7. Peirce's Formulation of Analogy (Version 1) • https://inquiryintoinquiry.files.wordpress.com/2022/04/peirces-formulation-… Regards, Jon