READ CAREFULLY

This software promotes some general and useful tools for handling, editing and computing (on) Boolean Functions defined either by conjonctive normal forms (clausal) or by disjonctive ones.

The harder main routine, among all existing others, is that of dualizing a given function. Other hard algorithms lie on chaining together this main one.

Thus it runs the risk of prohibitive time and/or some lack of memory, heightened by the fact that the number of opened windows is a priori unbounded. Therefore it is wise (for big functions) to save a maximum of documents.

In this software

In the present version, even if we may deal with functions having 40000 terms, their display are truncated to a maximum of 32000 characters (including blanks and operators); for example a function of 3000 terms of degree 7 is fully displayed.

This seems wise enough : may anyone grasp a function of 40000 terms ? Selecting terms by suitable procedures (in the menu construction) may split and analyze such a monster.