Symbolic expressions are tested for zero with bool(ex) at the moment, regardless if one wants to know if ex is identical with the zero object or if one wants a simplification of ex (which is slow).
Because a finer-grained interface is needed that does not surprise the user I would like to have your opinion how the function should be named that attempts a simplification/proof. [ ] - ex.holds() and holds(ex) [ ] - ex.truth() and truth(ex) [ ] - your idea: ... Thanks in advance for your opinion! You can see the bigger picture with code at: http://trac.sagemath.org/ticket/19040 Regards, -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
