目录
第一章:逻辑证明
逻辑公式
谓词演算等价式或蕴含式
推理方法
证明方法
附加前提法
归谬法
量词化简规则
第一章:逻辑证明
逻辑公式
p /\ T ≡p Identity laws
p \/ F ≡p (同一律)
---------------------------------------------------------------------
p \/ T ≡T Domination laws
p /\ F ≡F (零律)
---------------------------------------------------------------------
p \/ p ≡p Idempotent laws
p /\ p ≡p (幂等律)
---------------------------------------------------------------------
¬(¬p) ≡p Double negation law
(双重否定律)
---------------------------------------------------------------------
p \/ q ≡ q \/ p Commutative laws
p /\ q ≡ q /\ P (交换律)
---------------------------------------------------------------------
(p \/ q) \/ r ≡ p \/ (q \/ r) Associative laws
(p /\ q) /\ r ≡ p /\ (q /\ r) (结合律)
---------------------------------------------------------------------
p \/ (q /\ r) ≡ (p \/ q) /\ (p \/ r) Distributive laws
p /\ (q \/ r) ≡ (p /\ q) \/ (p /\ r) (分配律)
---------------------------------------------------------------------
¬(p /\ q) ≡ ¬p \/ ¬q De Morgan’s laws
¬(p \/ q) ≡ ¬p /\ ¬q (德摩根律)
---------------------------------------------------------------------
p \/ (p /\ q) ≡ p Absorption laws
p /\ (p \/ q) ≡ p (吸收律)
---------------------------------------------------------------------
p \/ ¬p ≡ T (排中律) Negation laws
p /\ ¬p ≡ F (矛盾律)
---------------------------------------------------------------------
p → q ≡ ¬p \/ q 蕴含等值式
---------------------------------------------------------------------
p → q ≡ ¬q → ¬p 假言易位
谓词演算等价式或蕴含式
推理方法
Modus ponens 假言推理
p
p→q
∴q
Modus tollens 拒取式
¬q
p→q
∴ ¬p
Hypothetical syllogism 假言三段论
p→q
q→r
∴ p→r
Disjunctive syllogism 析取三段论
p \/ q
¬p
∴ q
Addition 附加
p
∴ p \/ q
Simplication 化简
p /\ q
∴ p
Conjunction 合取
p
q
∴ p /\ q
Resolution 消解
p \/ q
¬p \/ r
∴ q \/ r
Contrspositive 置换
p→q
∴¬q→¬p
证明方法
附加前提法
(
A1 /\ A2 /\ … /\ Ak ) → (A →B)
≡ ¬ (A1 /\ A2 /\ … /\ Ak ) \/ (¬A \/ B)
≡ (¬ (A1 /\ A2 /\ … /\ Ak ) \/ ¬A) \/ B
≡ ¬ (A1 /\ A2 /\ … /\ Ak /\ A) \/ B
≡ (A1 /\ A2 /\ … /\ Ak /\ A) → B
A 为 附加前提引入
归谬法
(A1 /\ A2 /\ … /\ Ak ) → B
≡¬ (A1 /\ A2 /\ … /\ Ak ) \/ B
≡¬ (A1 /\ A2 /\ … /\ Ak /\ ¬B)
¬B 为 结论否定引入
量词化简规则
Universal instantiation UI规则
∀
x P(x)
∴ P(c)
Universal generalization UG规则
P(c) for an arbitrary c
∴∀x P(x)
Existential instantiation EI规则
∃
x P(x)
∴P(c) for some element c
Existential generalization EG规则
P(c) for some element c
∃x P(x)
第二章:集合、函数、矩阵