#19670: Consistency and redundancy of verbal assumptions
-------------------------+-----------------------------
Reporter: rws | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-6.10
Component: symbolics | Keywords:
Merged in: | Authors:
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-------------------------+-----------------------------
Maxima's assumption framework (still used by Sage's `GenericDeclaration`)
has only rudimentary consistency and no redundancy checking.
{{{
sage: assume(x>0)
sage: assume(x,'real')
sage: assume(x,'imaginary')
sage: assume(x,'complex')
sage: assumptions()
[x > 0, x is real, x is imaginary, x is complex]
}}}
This ticket should wrestle the `GenericDeclaration` consistency checking
(not the same with relations!) from Maxima, implementing it directly in
Python, only informing Maxima about any such assumption. And by the way
add the `positive` and `negative` keywords.
--
Ticket URL: <http://trac.sagemath.org/ticket/19670>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
