A Note on Entropy of Logic

Marija Boričić

We propose an entropy based classification of propositional calculi. Our method can be applied to finite–valued propositional logics and then, extended asymptotically to infinite–valued logics. In this paper we consider a classification depending on the number of truth values of a logic and not on the number of its designated values. Furthermore, we believe that almost the same approach can be useful in classification of finite algebras.