命题逻辑中等价公式的证明方法探讨
On the Proof Methods of Propositional Equivalences in Propositional Logic
摘要: 命题公式是命题逻辑中的基本研究对象。判定两个命题公式是否逻辑等价是一个重要问题。本文结合例题讲解，对证明两个命题公式等价的方法进行了总结，共提出六种方法，并对各种方法进行了分析和探讨。
Abstract:
Propositional formulas are the basic contents in propositional logic. It is an important problem to determine whether two propositional formulas are logically equivalent. The paper summarizes six methods about how to prove the equivalence of two propositional formulas by specific examples, and discusses the relations of these methods.
参考文献
|
[1]
|
Rosen, K.H. (1999) Discrete Mathematics and Its Applications. China Machine Press, Beijing.
|
|
[2]
|
Kolman, B., Busby, R.C. and Ross, C.S. (2006) Discrete Mathematics Structures. 5th Edition, Higher Education Press, Beijing.
|
|
[3]
|
左孝凌, 李为鉴, 刘永才. 离散数学[M]. 上海: 上海科学技术文献出版社, 1982.
|
|
[4]
|
杜君花, 梁红梅, 马艳萍. 数理逻辑的若干应用[J]. 高师理科学刊, 2018(9): 56-60.
|
|
[5]
|
王礼萍, 张树功. 重言式和矛盾式的代数化证明[J]. 计算机与数字工程, 2009(37): 17-21.
|
|
[6]
|
徐小萍. 命题公式类型的判定方法[J]. 廊坊师范学院学报(自然科学版), 2010(10): 7-10.
|