Abstract

Consider the set of tautologies of the classical propositional calculus containing no connective other than and, or, and not. Consider the subset of this set containing tautologies in exactlyn propositional variables. This paper provides a method for determining the number of equivalence classes of each such subset modulo equivalence in the infinite-valued Lukasiewicz propositional calculus.