Modern w:algebra is based on w:set theory. There is two problems with this. First, there is no set of all sets. For a proof of this see w: Russell's paradox. Second, while the concept of sets seems cogent to humans, computers have a tough time dealing with them. There are several advantages to formulating algebra on class algebra rather than set theory. First, there is a class of all sets. So, class algebra can contain modern algebra without difficulty. Second, Boolean algebra is a class algebra. So, symbolic logic can be uploaded into this reformulated algebra without much difficulty. Third, while computers have a tough time dealing with sets, they deal with classes of objects extremely well. So, computers can be enlisted to solve problems that are just too complex for humans to grasp. In addition, it is easier to formulate algebra in a way that is cogent to computers than it is to write computer code that can handle set theory. I will refer to this reformulated algebra as “Mathics”. The term “Bistromathics” was apparently coined by the late Douglas Adams as a joke.  The term “Mathics” is already in use by computer scientists to refer to computer algebra.  However, there is still no universally agreed upon syntax and semantics for computer algebras and, although the word “mathics” is already in wide spread use, it has no generally agreed upon meaning.