Skip to main content
SpringerLink
Log in

Theorem counting

  • Published:
Topoi Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Reference

  • McNaughton, Robert: 1951, ‘A Theorem About Infinite-Valued Sentential Logic’,Journal of Symbolic Logic 16, 1–13.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of the Ozarks, 415 College Ave, 72830, Clarksville, AR, U.S.A.

    M. G. Beavers

Authors
  1. M. G. Beavers
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Beavers, M.G. Theorem counting. Topoi 13, 61–65 (1994). https://doi.org/10.1007/BF00763649

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00763649

Keywords

Search

Navigation