Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Consistency and redundancy of verbal assumptions #19670

Open
rwst opened this issue Dec 5, 2015 · 0 comments
Open

Consistency and redundancy of verbal assumptions #19670

rwst opened this issue Dec 5, 2015 · 0 comments

Comments

@rwst
Copy link

rwst commented Dec 5, 2015

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.

Component: symbolics

Issue created by migration from https://trac.sagemath.org/ticket/19670

@rwst rwst added this to the sage-6.10 milestone Dec 5, 2015
@mkoeppe mkoeppe removed this from the sage-6.10 milestone Dec 29, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants