> A) the type inference system should assume classical logic when /\ or \/ are > used.
No. Actually, I've programmed (still a bit buggy) a disjunctive normalform representation over some set (variables or whatever). It's rather specialized, but I found it the right approach for dealing with the conditions in the API representation. Look for example at the condition for the export of AbelianMonoid at the end of http://www.hemmecke.de/fricas/html/AbelianMonoidRing.html . There are and's and or's. It's still a mess, but I would use simple classical logic. > B) all domains that use /\ or \/ (like varous logic and CliffordAlgebra) must > obey certain identities. I'm not as ambitious as you. Just propositional calculus with the clasical rules, i.e. ~, /\, and \/, as well as true and false, would be enough. I just thought there would already be something like that in FriCAS or your recent additons. Ralf -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" 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/fricas-devel. For more options, visit https://groups.google.com/d/optout.
