A NOTE ON ENTROPY OF LOGIC
We propose an entropy based classiﬁcation of propositional calculi. Our method can be applied to ﬁnite–valued propositional logics and then, extended asymptotically to inﬁnite–valued logics. In this paper we consider a classiﬁcation depending on the number of truth values of a logic (but not on the number of its designated values). Furthermore, we believe that almost the same approach can be useful in classiﬁcation of ﬁnite algebras.
Keywords: Many–valued Propositional Logics, Lindenbaum–Tarski Algebra, Partition, Entropy.
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.