MyWikiBiz, Author Your Legacy — Friday November 01, 2024
Jump to navigationJump to search
144 bytes added
, 14:52, 18 January 2009
Line 3,139: |
Line 3,139: |
| | | |
| The preceding discussion of stretch operations is slightly more general than is called for in the present context, and so it is probably a good idea to draw out the particular implications that are needed right away. | | The preceding discussion of stretch operations is slightly more general than is called for in the present context, and so it is probably a good idea to draw out the particular implications that are needed right away. |
| + | |
| + | If <math>F : \underline\mathbb{B}^k \to \underline\mathbb{B}</math> is a boolean function on <math>k\!</math> variables, then it is possible to define a mapping <math>F^\$ : (X \to \underline\mathbb{B})^k \to (X \to \underline\mathbb{B}),</math> in effect, an operation that takes <math>k\!</math> propositions into a single proposition, where <math>F^\$</math> satisfies the following conditions: |
| | | |
| <pre> | | <pre> |
− | If F : Bk -> B is a boolean function on k variables, then it is possible to define a mapping F$ : (U -> B)k -> (U -> B), in effect, an operation that takes k propositions into a single proposition, where F$ satisfies the following conditions:
| + | F$(f1, ..., fk) : U -> B |
− | | |
− | F$(f1, ..., fk) : U -> B | |
| : | | : |
| F$(f1, ..., fk)(u) = F(f(u)) | | F$(f1, ..., fk)(u) = F(f(u)) |