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.
Similar content being viewed by others
Reference
McNaughton, Robert: 1951, ‘A Theorem About Infinite-Valued Sentential Logic’,Journal of Symbolic Logic 16, 1–13.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Beavers, M.G. Theorem counting. Topoi 13, 61–65 (1994). https://doi.org/10.1007/BF00763649
Issue Date:
DOI: https://doi.org/10.1007/BF00763649