Hi All,
I'm currently trying to implement a function for the propositional
calculus package that would determine if two statements are logically
equivalent. The usage would be something along the lines of:
sage: a = propcalc.formula('a | (b&c)')
sage: b = propcalc.formula('(x&y) | z')
sage: a.equivlant(b)
True
One way to do this would be to examine the truth tables of each for
every possible mapping of the variable, but the run time would be
exponential plus some. Does anyone know of a better way to implement
this?
Thank you.
-Chris Gorecki
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
