【正文】
hen, Zhejiang Univ.Propositional Equivalences命題演算命題演算 令 A( a a …… 、 an) 包含有 n個變量的公式,極小項 (extremal ~):小項中恰包含 n個變量或其否定。析取范式( disjunctive normal form): 若干個小項的析取。Date 26Deren Chen, Zhejiang Univ.Propositional Equivalences命題演算命題演算 進(jìn)一步的思考:三、命題公式的進(jìn)一步分類。邏輯聯(lián)接詞組是 極小功能完備的 : 是功能完備的并且不能少一個。命題公式 P的 對偶公式( Dual) :將 P中的 析取聯(lián)結(jié)詞換成合取聯(lián)結(jié)詞, 合取聯(lián)結(jié)詞換成析取聯(lián)結(jié)詞, T換成 F, F換成 T( 如果存在的話)。P:她來。Date 3Deren Chen, Zhejiang Univ.Propositional Equivalences命題演算命題演算 EXAMPLE 1 We can construct examples of tautologies and contradictions using just one proposition. Consider the truth tables of p∨ p and p∧ p, shown in Table 1. Since p∨ p is always true, it is a tautology. Since p∧ p is always false, it is a contradiction.Date 4Deren Chen, Zhejiang Univ.Propositional Equivalences命題演算命題演算 Table 1Date 5Deren Chen, Zhejiang Univ.Propositional Equivalences命題演算命題演算 DEFINITION 2 The propositions p and q are called logically equivalent if p q is a tautotogy. The notation p q denotes that p and q are logically equivalent.邏輯等值,或邏輯等價Date 6Deren Chen, Zhejiang Univ.Propositional Equivalences命題演算命題演算 EXAMPLE 2 Show that (p∨ q) and p∧ q are logically equivalent. This equivalence is one of De Man39。Propositional Equivalences命題演算命題演算 命題演算 Propositional EquivalencesDate 1Deren Chen, Zhejiang Univ.Propositional Equivalences命題演算命題演算 命題 (Proposition) 從簡單命題 (atomic proposition)到