Besonderhede van voorbeeld: -9186311212085650850

English

If P,Q, and F are propositions and F is known to be false, then: ¬P is equivalent to P → F P ∧ Q is equivalent to (P → (Q → F)) → F P ∨ Q is equivalent to (P → Q) → Q P ↔ Q is equivalent to ((P → Q) → ((Q → P) → F)) → F More generally, since the above operators are known to be functionally complete, it follows that any truth function can be expressed in terms of "→" and "F", if we have a proposition F which is known to be false.

Chinese

如果 P,Q 和 F 是命题而 F 已知为假,则: ¬P 等价于 P→F P∧Q 等价于 (P→(Q→F))→F P∨Q 等价于 (P→F)→Q P↔Q 等价于 ((P→Q)→((Q→P)→F))→F 更一般的说,因为上述算子对表达任何真值函数是充分的,可以得出任何真值函数都依据“→”和“F”来表达,如果有一个命题 F 已知为假。