On 1/8/04 6:50, Nick Cox wrote
[snip...]
If the lazy evaluation model were used, 'or' would be true as long as at
least one is true, and 'and' would be false if at least one is false.
Extending this with the normally unnecessary extensions that 'or' is
false if all are false, and 'and' is true if all are true would give a
nice logical way to work.
>
>1. fill in truth tables
>
& true false irrelevant
true T F I
false F F F
irrelevant I F I
>
| true false irrelevant
true T T T
false T F I
irrelevant T I I
This still keeps the !(A|B) = (!A) & (!B) and the !(A&B) = (!A) | (!B)
working fine, as well as the distributive laws.
[...]
I should add that what Bill refers to is three-valued logic, for which I
have written some egen functions. See the trinary package; -findit trinary-