一阶逻辑等值演算与推理
一阶逻辑中的基本等值式:
第一组:16组等值式给出的代换实例都是一阶逻辑的等值式。
第二组:
量词否等等值式
¬ ∀ x A ( x ) ⇔ ∃ x ¬ A ( x ) \neg \forall xA(x) \Leftrightarrow \exists x \neg A(x) ¬∀xA(x)⇔∃x¬A(x)
¬ ∃ x A ( x ) ⇔ ∀ x ¬ A ( x ) \neg \exists xA(x) \Leftrightarrow \forall x \neg A(x) ¬∃xA(x)⇔∀x¬A(x)
量词辖域收缩域扩张等值式:
∀
x
(
A
(
x
)
∨
B
)
⇔
∀
x
A
(
x
)
∨
B
∀
x
(
A
(
x
)
∧
B
)
⇔
∀
x
A
(
x
)
∧
B
∀
x
(
A
(
x
)
→
B
)
⇔
∃
x
A
(
x
)
→
B
∀
x
(
B
→
A
(
x
)
)
⇔
B
→
∀
x
A
(
x
)
∃
x
(
A
(
x
)
∨
B
)
⇔
∃
x
A
(
x
)
∨
B
∃
x
(
A
(
x
)
∧
B
)
⇔
∃
x
A
(
x
)
∧
B
∃
x
(
A
(
x
)
→
B
)
⇔
∀
x
A
(
x
)
→
B
∃
x
(
B
→
A
(
x
)
)
⇔
B
→
∃
x
A
(
x
)
\begin{array}{l} \forall x(A(x) \vee B) \Leftrightarrow \forall x A(x) \vee B \\ \forall x(A(x) \wedge B) \Leftrightarrow \forall x A(x) \wedge B \\ \begin{aligned} \forall x(A(x) \rightarrow B) & \Leftrightarrow \exists x A(x) \rightarrow B \\ \forall x(B \rightarrow A(x)) & \Leftrightarrow B \rightarrow \forall x A(x) \end{aligned} \\ \exists x(A(x) \vee B) \Leftrightarrow \exists x A(x) \vee B \\ \exists x(A(x) \wedge B) \Leftrightarrow \exists x A(x) \wedge B \\ \begin{array}{l} \exists x(A(x) \rightarrow B) \Leftrightarrow \forall x A(x) \rightarrow B \\ \exists x(B \rightarrow A(x)) \Leftrightarrow B \rightarrow \exists x A(x) \end{array} \end{array}
∀x(A(x)∨B)⇔∀xA(x)∨B∀x(A(x)∧B)⇔∀xA(x)∧B∀x(A(x)→B)∀x(B→A(x))⇔∃xA(x)→B⇔B→∀xA(x)∃x(A(x)∨B)⇔∃xA(x)∨B∃x(A(x)∧B)⇔∃xA(x)∧B∃x(A(x)→B)⇔∀xA(x)→B∃x(B→A(x))⇔B→∃xA(x)
量词分配等值式:
∀
x
(
A
(
x
)
∧
B
(
x
)
)
⇔
∀
x
A
(
x
)
∧
∀
x
B
(
x
)
∃
x
(
A
(
x
)
∨
B
(
x
)
)
⇔
∃
x
A
(
x
)
∨
∃
x
B
(
x
)
\forall x(A(x) \wedge B(x)) \Leftrightarrow \forall x A(x) \wedge \forall x B(x) \\ \exists x(A(x) \vee B(x)) \Leftrightarrow \exists x A(x) \vee \exists x B(x)
∀x(A(x)∧B(x))⇔∀xA(x)∧∀xB(x)∃x(A(x)∨B(x))⇔∃xA(x)∨∃xB(x)
换名规则:设A为一公式,将A中某量词辖域中的一个约束变项的所有出现及响应的指导变元全部改成该量词辖域中未曾出现过的某个个体变项符号,公式中其余部分不变,将所得公式记作A‘,A’<=>A。
一阶逻辑的推理定律
1.命题逻辑推理定律的代换实例
2.基本等值式生成的推理定律
3.一些常用的重要推理定律:
∀
x
A
(
x
)
∨
∀
x
B
(
x
)
⇒
∀
x
(
A
(
x
)
∨
B
(
x
)
)
∃
x
(
A
(
x
)
∧
B
(
x
)
)
⇒
∃
x
A
(
x
)
∧
∃
x
B
(
x
)
∀
x
(
A
(
x
)
→
B
(
x
)
)
⇒
∀
x
A
(
x
)
→
∀
x
B
(
x
)
∀
x
(
A
(
x
)
→
B
(
x
)
)
⇒
∃
x
A
(
x
)
→
∃
x
B
(
x
)
\begin{array}{l} \forall x A(x) \vee \forall x B(x) \Rightarrow \forall x(A(x) \vee B(x)) \\ \exists x(A(x) \wedge B(x)) \Rightarrow \exists x A(x) \wedge \exists x B(x) \\ \forall x(A(x) \rightarrow B(x)) \Rightarrow \forall x A(x) \rightarrow \forall x B(x) \\ \forall x(A(x) \rightarrow B(x)) \Rightarrow \exists x A(x) \rightarrow \exists x B(x) \end{array}
∀xA(x)∨∀xB(x)⇒∀x(A(x)∨B(x))∃x(A(x)∧B(x))⇒∃xA(x)∧∃xB(x)∀x(A(x)→B(x))⇒∀xA(x)→∀xB(x)∀x(A(x)→B(x))⇒∃xA(x)→∃xB(x)
量词消去与引入规则
∀
x
A
(
x
)
∴
A
(
y
)
或
∀
x
A
(
x
)
∴
A
(
c
)
A
(
y
)
∴
∀
x
A
(
x
)
∃
x
A
(
x
)
A
(
y
)
→
B
∴
B
或
A
(
y
)
→
B
∴
∃
x
A
(
x
)
→
B
∃
x
A
(
x
)
A
(
c
)
→
B
∴
B
或
A
(
c
)
→
B
∴
∃
x
A
(
x
)
→
B
\frac{\forall x A(x)}{\therefore A(y)} \text { 或 } \frac{\forall x A(x)}{\therefore A(c)}\\ \frac{A(y)}{\therefore \forall x A(x)}\\ \begin{array}{lll} \exists x A(x) & & \\ \frac{A(y) \rightarrow B}{\therefore B} & \text { 或 } & \frac{A(y) \rightarrow B}{\therefore \exists x A(x) \rightarrow B} \\ \exists x A(x) & & \\ \frac{A(c) \rightarrow B}{\therefore B} & \text { 或 } & \frac{A(c) \rightarrow B}{\therefore \exists x A(x) \rightarrow B} \end{array}
∴A(y)∀xA(x) 或 ∴A(c)∀xA(x)∴∀xA(x)A(y)∃xA(x)∴BA(y)→B∃xA(x)∴BA(c)→B 或 或 ∴∃xA(x)→BA(y)→B∴∃xA(x)→BA(c)→B