命题逻辑PL表达能力和应用

The Expression Capacity and Application of Propositional Logic PL

命题逻辑PL系统依靠(?),∧,∨,→,←→算子是否足以表达任意n元布尔函数,是大多逻辑著作不注重叙述的问题,本文就此作详细的说明;在此基础上,利用二叉树内在的结构特点,定义INF范式的表达,以该范式的惟一性展现命题公式在计算上的独特作用。

Abstract＂ The issue as to whether the system of Propositional Logic PL can rely on operators , ∧,∨,→,←→ to sufficiently express arbitrary n-Boolean functions is often failed to be sufficiently discussed in many books on logic. This is what this paper comes up with; furthermore, by using the characteristics inherent in the binary tree structure, this paper discusses the expression of the INF normal formula and its uniqueness in displaying the function of propositional formulas in calculation.