首页 | 本学科首页   官方微博 | 高级检索  
   检索      


Theorem counting
Authors:M G Beavers
Institution:(1) Department of Mathematics, University of the Ozarks, 415 College Ave, 72830 Clarksville, AR, U.S.A.
Abstract:Consider the set of tautologies of the classical propositional calculus containing no connective other than lsquoand, lsquoorrsquo, and lsquonotrsquo. 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.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号