Hyper-propositional normalizations and canonizations

online since May 2007

Abstract

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
[1],
we developed canonizers for propositional logic and we implemented the ideas in a software system
[2].
Here we try to build similar and effective systems for hyper-propositional formulas
[3].