2 replies to this topic

[fiberoptik]

It woul be great that CP could simplify logical operations like :

(P v Q) => ~(P v ~Q)

and also Boolean Algebra ( great for Digital Systems )

I didn't read all the manual yet, but i think i haven't seen any of this functions there.

Edit

This one also should appear in the Suggestions section, i really don't understand.
Once again sorry

Edited by fiberoptik, 10 November 2004 - 10:51 PM.

[Griott]

(P v Q) => ~(P v ~Q)

If I'm not wrong, (P v Q) => ~( ~P ^ ~Q)

On the cp, you can do the following

simplify(not(p   or  not(q)))
         not(p) and q
simplify(not(not(p)  and not(q))))
         p or q

[fiberoptik]

Griot, you are right, but the expression i wrote was an example to enter in the CP to get the logical value (True or False) not to simplify. Any way thank you for answering me , i will try what you told me.

Thanks