Line 1,050: |
Line 1,050: |
| | | |
| ==Work Area== | | ==Work Area== |
| + | |
| + | ===Logical Translation Rule 1=== |
| | | |
| <pre> | | <pre> |
Line 1,073: |
Line 1,075: |
| | | |
| <br> | | <br> |
| + | |
| + | ===Geometric Translation Rule 1=== |
| | | |
| <pre> | | <pre> |
Line 1,095: |
Line 1,099: |
| | | |
| <br> | | <br> |
| + | |
| + | ===Logical Translation Rule 2=== |
| | | |
| <pre> | | <pre> |
Line 1,142: |
Line 1,148: |
| | | |
| <br> | | <br> |
| + | |
| + | ===Geometric Translation Rule 2=== |
| | | |
| <pre> | | <pre> |
Line 1,188: |
Line 1,196: |
| | | |
| <br> | | <br> |
| + | |
| + | ===Value Rule 1=== |
| | | |
| <pre> | | <pre> |
Line 1,208: |
Line 1,218: |
| | | |
| <br> | | <br> |
| + | |
| + | ===Value Rule 1=== |
| | | |
| <pre> | | <pre> |
Line 1,221: |
Line 1,233: |
| | | |
| V1c. (( v , w )). | | V1c. (( v , w )). |
− | </pre>
| |
| | | |
− | <pre>
| |
| A rule that allows one to turn equivalent sentences into identical propositions: | | A rule that allows one to turn equivalent sentences into identical propositions: |
| | | |
Line 1,267: |
Line 1,277: |
| | | |
| V1c. (( f , g ))$ | | V1c. (( f , g ))$ |
| + | </pre> |
| + | |
| + | ===Evaluation Rule 1=== |
| | | |
| + | <pre> |
| Evaluation Rule 1 | | Evaluation Rule 1 |
| | | |
Line 1,304: |
Line 1,318: |
| :: | | :: |
| E1d. (( f , g ))$(u). :$1b | | E1d. (( f , g ))$(u). :$1b |
| + | </pre> |
| | | |
| + | ===Definition 2=== |
| | | |
| + | <pre> |
| Definition 2 | | Definition 2 |
| | | |
Line 1,315: |
Line 1,332: |
| | | |
| D2b. u C X <=> u C Y, for all u C U. | | D2b. u C X <=> u C Y, for all u C U. |
| + | </pre> |
| | | |
| + | ===Definition 3=== |
| + | |
| + | <pre> |
| Definition 3 | | Definition 3 |
| | | |
Line 1,325: |
Line 1,346: |
| | | |
| D3b. f(u) = g(u), for all u C U. | | D3b. f(u) = g(u), for all u C U. |
| + | </pre> |
| | | |
| + | ===Definition 4=== |
| + | |
| + | <pre> |
| Definition 4 | | Definition 4 |
| | | |
Line 1,335: |
Line 1,360: |
| | | |
| D4b. {<u, v> C UxB : v = [u C X]} | | D4b. {<u, v> C UxB : v = [u C X]} |
| + | </pre> |
| | | |
| + | ===Definition 5=== |
| + | |
| + | <pre> |
| Definition 5 | | Definition 5 |
| | | |
Line 1,347: |
Line 1,376: |
| | | |
| : f(u) = [u C X], for all u C U. | | : f(u) = [u C X], for all u C U. |
| + | </pre> |
| | | |
− | Given an indexed set of sentences, Sj for j C J, it is possible to consider the logical conjunction of the corresponding propositions. Various notations for this concept are be useful in various contexts, a sufficient sample of which are recorded in Definition 6.
| + | ===Definition 6=== |
| | | |
| + | <pre> |
| Definition 6 | | Definition 6 |
| | | |
Line 1,367: |
Line 1,398: |
| | | |
| D6e. ConjJj Sj. | | D6e. ConjJj Sj. |
| + | </pre> |
| | | |
| + | ===Definition 7=== |
| + | |
| + | <pre> |
| Definition 7 | | Definition 7 |
| | | |
Line 1,378: |
Line 1,413: |
| | | |
| D7b. [S] = [T]. | | D7b. [S] = [T]. |
| + | </pre> |
| + | |
| + | ===Rule 5=== |
| | | |
| + | <pre> |
| Rule 5 | | Rule 5 |
| + | |
| If X, Y c U, | | If X, Y c U, |
| | | |
Line 1,398: |
Line 1,438: |
| :: | | :: |
| R5e. {X} = {Y}. :D5a | | R5e. {X} = {Y}. :D5a |
| + | </pre> |
| | | |
| + | ===Rule 6=== |
| + | |
| + | <pre> |
| Rule 6 | | Rule 6 |
| | | |
Line 1,411: |
Line 1,455: |
| :: | | :: |
| R6c. ConjUu (f(u) = g(u)). :D6e | | R6c. ConjUu (f(u) = g(u)). :D6e |
| + | </pre> |
| | | |
| + | ===Rule 7=== |
| + | |
| + | <pre> |
| Rule 7 | | Rule 7 |
| | | |
Line 1,431: |
Line 1,479: |
| :: | | :: |
| R7f. ConjUu (( P , Q ))$(u). :$1b | | R7f. ConjUu (( P , Q ))$(u). :$1b |
| + | </pre> |
| | | |
| + | ===Rule 8=== |
| | | |
| + | <pre> |
| Rule 8 | | Rule 8 |
| | | |
Line 1,454: |
Line 1,505: |
| :: | | :: |
| R8g. ConjUu (( [S] , [T] ))$(u). :R7f | | R8g. ConjUu (( [S] , [T] ))$(u). :R7f |
| + | </pre> |
| | | |
− | For instance, the observation that expresses the equality of sets in terms of their indicator functions can be formalized according to the pattern in Rule 9, namely, at lines (a, b, c), and these components of Rule 9 can be cited in future uses as "R9a", "R9b", "R9c", respectively. Using Rule 7, annotated as "R7", to adduce a few properties of indicator functions to the account, it is possible to extend Rule 9 by another few steps, referenced as "R9d", "R9e", "R9f", "R9g".
| + | ===Rule 9=== |
| | | |
| + | <pre> |
| Rule 9 | | Rule 9 |
| | | |
Line 1,477: |
Line 1,530: |
| :: | | :: |
| R9g. ConjUu (( {X} , {Y} ))$(u). :R7f | | R9g. ConjUu (( {X} , {Y} ))$(u). :R7f |
| + | </pre> |
| + | |
| + | |
| + | ===Rule 10=== |
| | | |
| + | <pre> |
| Rule 10 | | Rule 10 |
| | | |
Line 1,501: |
Line 1,559: |
| :: | | :: |
| R10h. ConjUu (( [u C X] , [u C Y] ))$(u). :R8g | | R10h. ConjUu (( [u C X] , [u C Y] ))$(u). :R8g |
| + | </pre> |
| + | |
| + | ===Rule 11=== |
| | | |
| + | <pre> |
| Rule 11 | | Rule 11 |
| | | |
Line 1,522: |
Line 1,584: |
| R11e. {X} = [S]. :R | | R11e. {X} = [S]. :R |
| </pre> | | </pre> |
| + | |
| + | ===Fact 1=== |
| | | |
| <pre> | | <pre> |