A false premise implies any conclusion.
Dave
On Jun 7, 7:59 am, thomas <[EMAIL PROTECTED]> wrote:
> for logical implication, I have puzzles.
>
> true table:
> 1->1 1 (if 1 then 1, ok)
> 1->0 0 (if 1 then 0, nok)
> 0->1 1 (if 0 then 1, ok? why?)
for logical implication, I have puzzles.
true table:
1->1 1 (if 1 then 1, ok)
1->0 0 (if 1 then 0, nok)
0->1 1 (if 0 then 1, ok? why?)
0->0 1 (if 0 then 0, ok)
I mainly have problem to understand the third one.
if proposition is
Recursion is so cool. If you're willing to practice, I'd recommend you
to try SML.
On Jun 6, 10:40 pm, "zee 99" <[EMAIL PROTECTED]> wrote:
> hi
>
> learnt that a tail recursive algorithm can be converted to a non recursive
> one by merely using a while and a goto
>
> is it true for all class of r
