【摘要】 在定量的意义下使模糊命题演算完全包容经典命题逻辑是不可能的 .布尔算子命题逻辑用算子和算子的演算定性地描述和处理模糊命题的不确定性 ,将经典命题逻辑作为其特例 .在布尔算子命题逻辑中给出了其公理系统和求公式恒真水平的机械推导算法更多还原

【Abstract】 It is impossible for a quantitative fuzzy propositional logic to subsume classical propositional logic. In this paper, Boolean operator propositional logic (BOPL), which is a natural generalization of classical propositional logic, is proposed. In BOPL, the uncertainties of fuzzy propositions are qualitatively characterized by fuzzy operators and their calculi. The axioms of BOPL and an algorithm for truth level of a given formula in BOPL are also provided.更多还原