Hi, I found a relevant missing feature

Boolean Algebra:

f.ex.
(a AND b ) OR a -> a



Regards,
Mike

Hello Mike,

Wrote

Boolean Algebra:

f.ex.
(a AND b ) OR a -> a

Mike

Interesting question. I have never thought of symbolic engine to take care of Boolean theorems and simplify Boolean expressions. I think this could be hardly possible because there are no Boolean variables here. Every number different then zero is regarded as "1" in the boolean operation (zero iz taken as "0" ). Therefor, the algebraic and logical operators can be mixed.

Regards,
Radovan

Ofcourse, it does that in my calculator too.
I just don't like having to write a VERY long line of algebra (For digital electronics f.ex.) to simplify it to save circuits and wire. :P

It would have to be used with caution though, cause as you say. If one of the variables are declared beforehand, it will also be 'declared' in the algebra and assumed to be what it is. Is there a possibility of creating new scopes in SMath?. F.ex. the "Line" element?. Haven't checked it.

But for a new scope, one could have all the variables be null'ed (Or simply create a new variable memory :P), and in this scope, anything new is possible. Would be great on paper for examples of calculation. :P