>> So "singleton" category can not be just one element set. > > ??? By *definition* it is a category that contains just one domain. > Are saying that this definition is inconsistent?
Sounds like both of you don't understand each other. Let me use Aldor here... ---BEGIN aaa.as #include "aldor" C: Category == with; D: C == add; ---END aaa.as ---BEGIN bbb.as C: Category == with; D1: C == add; D2: C == add; ... Dn: C == add; ---END bbb.as In aaa.as C is a category that only has exactly one domain in it. But this is only true if I consider one fixed program. As bbb.as shows that "singleton" category definition depends on the context. Thus, Waldek is right, that a category always contains (potentially) infinitely many domains (or in other words, one can define infinitely many domains to a given category). Did I understand you intentions correctly? Ralf --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/fricas-devel?hl=en -~----------~----~----~----~------~----~------~--~---
