Changes

MyWikiBiz, Author Your Legacy — Thursday September 26, 2024
Jump to navigationJump to search
Line 356: Line 356:     
==Selection 6==
 
==Selection 6==
 +
 +
===The Signs for Multiplication (cont.)===
    
{| align="center" cellspacing="6" width="90%" <!--QUOTE-->
 
{| align="center" cellspacing="6" width="90%" <!--QUOTE-->
 
|
 
|
<p>'''The Signs for Multiplication''' (cont.)</p>
  −
   
<p>A conjugative term like ''giver'' naturally requires two correlates, one denoting the thing given, the other the recipient of the gift.</p>
 
<p>A conjugative term like ''giver'' naturally requires two correlates, one denoting the thing given, the other the recipient of the gift.</p>
   Line 442: Line 442:  
|}
 
|}
   −
Peirce's way of representing sets as sums may seem archaic, but it is quite often used, and is actually the tool of choice in many branches of algebra, combinatorics, computing, and statistics to this very day.
+
===Comment : Sets as Logical Sums===
 +
 
 +
Peirce's way of representing sets as logical sums may seem archaic, but it is quite often used, and is actually the tool of choice in many branches of algebra, combinatorics, computing, and statistics to this very day.
   −
Peirce's application to logic is fairly novel, and the degree of his elaboration of the logic of relative terms is certainly original with him, but this particular genre of representation, commonly going under the handle of "generating functions", goes way back, well before anyone thought to stick a flag in set theory as a separate territory or to try to fence off our native possessions of it with expressly decreed axioms.  And back in the days when computers were people, before we had the sorts of "electronic register machines" that we take so much for granted today, mathematicians were constantly using generating functions as a rough and ready type of addressable memory to sort, store, and keep track of their accounts of a wide variety of formal objects of thought.
+
Peirce's application to logic is fairly novel, and the degree of his elaboration of the logic of relative terms is certainly original with him, but this particular genre of representation, commonly going under the handle of ''generating functions'', goes way back, well before anyone thought to stick a flag in set theory as a separate territory or to try to fence off our native possessions of it with expressly decreed axioms.  And back in the days when a computer was just a person who computed, before we had the sorts of ''electronic register machines'' that we take so much for granted today, mathematicians were constantly using generating functions as a rough and ready type of addressable memory to sort, store, and keep track of their accounts of a wide variety of formal objects of thought.
    
Let us look at a few simple examples of generating functions, much as I encountered them during my own first adventures in the Fair Land Of Combinatoria.
 
Let us look at a few simple examples of generating functions, much as I encountered them during my own first adventures in the Fair Land Of Combinatoria.
   −
Suppose that we are given a set of three elements, say, {''a'',&nbsp;''b'',&nbsp;''c''}, and we are asked to find all the ways of choosing a subset from this collection.
+
Suppose that we are given a set of three elements, say, <math>\{ a, b, c \}\!</math>, and we are asked to find all the ways of choosing a subset from this collection.
    
We can represent this problem setup as the problem of computing the following product:
 
We can represent this problem setup as the problem of computing the following product:
   −
: (1 + ''a'')(1 + ''b'')(1 + ''c'').
+
{| align="center" cellspacing="6" width="90%"
 +
| <math>(1 + a)(1 + b)(1 + c)\!</math>.
 +
|}
   −
The factor (1&nbsp;+&nbsp;''a'') represents the option that we have, in choosing a subset of {''a'',&nbsp;''b'',&nbsp;''c''}, to leave the ''a'' out (signified by the "1"), or else to include it (signified by the "''a''"), and likewise for the other elements ''b'' and ''c'' in their turns.
+
The factor <math>(1 + a)\!</math> represents the option that we have, in choosing a subset of <math>\{ a, b, c \}\!</math>, to leave the element <math>a\!</math> out (signified by the "<math>1\!</math>"), or else to include it (signified by the "<math>a\!</math>"), and likewise for the other elements <math>b\!</math> and <math>c\!</math> in their turns.
    
Probably on account of all those years I flippered away playing the oldtime pinball machines, I tend to imagine a product like this being displayed in a vertical array:
 
Probably on account of all those years I flippered away playing the oldtime pinball machines, I tend to imagine a product like this being displayed in a vertical array:
12,080

edits

Navigation menu