A normalizer is a function that takes a formula and returns an equivalent formula, usually with specific formal properties and called normal form. A normalizer is canonic or a canonizer, if every two equivalent formulas always have identical normal forms. In an earlier text , we developed canonizers for propositional logic and we implemented the ideas in a software system . Here we try to build similar and effective systems for hyper-propositional formulas .
.... work in progress ....
Theory and implementation of efficient canonical systems for sentential calculus, based on Prime Normal Forms
 Guide to the bucanon software
 Hyper-digital logic: Summarized overview of its syntax and semantics