2015离散数学命题公式.pptVIP

联结词是否够用 每种联结词对应一种四个T或F的组合，总共可以有24=16种组合，似乎需要16种联结词才够用。 事实上，我们定义的这九种就够用了。 最小联结词组 最小联结词组应为{?，?}或{?，?}，亦可以为{?}或{?}。 证明：1）用这些联结词组可以表示其它的联结词。 2）用{?}，{?}，{?}以及{?，?}不能表示其它的联结词。 ① {?}不能表示? ，? ，… 因为含有二元联结词的命题公式不能用仅含一元联结词的命题公式等价代换。 最小联结词组（续）　 ② {?} ， {?}或{?，?}不能表示? 因为如果有?P?(…(P?Q) ? … ? …) 若对右边所出现的变元都指派真值为Ｔ，由?，?定义可知其真值必为Ｔ，而左边的真值为Ｆ，矛盾。 一般来说，命题公式用{? ，?，?}表示。 （8）证明{ }，{ }和{? }不是最小联结词组。 （9）证明{? ，?}，和{? ，? }是最小联结词组。 ? ? C Introduction to Logic * Which is the minimal number of truth-functional connectives? According to the Statement on normal forms (see slide 7) the following connectives suffice: ?, ?, ? (funkcionally complete system) The following systems of truth-functional connectives are functionally complete: 1. {?, ?, ?}, 2. {?, ?} or {?, ?}, 3. {?, ?}, {?} or {?}. Hence in order to express any truth-value function (and thus any PL formula) just one connective suffices! Either Scheffer’s NAND ? or Pierce’s NOR ? Three tasks 1. what is tautology and contradiction ? --classification of wff 2. what is logical equivalences? --relation between two wff. --change proposition’s form but truth value remain unchanged 3. How many logical operators in the wff and what is 最小联结词组? * What your name? A compound proposition that is always true, no matter what the truth values of the propositional variables that occur in it, is called a tautology . A compound proposition that is always false is called a contradiction. A compound proposition that is neither a tautology nor a contradiction is called a contingency.用一个命题表达出来。 My name is tautology p q p ?q ?p ?q ?q??p (p ?q)?(?q??p) T T T F F T T T F F F T F T F T T T F T T F F T T T T T p q p ?q ?p ?p?(p ?q) T T T F T T F F F T F T T T T F F T T T My name is contradiction p q p ? q p?(p ? q) ?(p?(p ? q)) T T T T F T F T T F F T T T F F F F T F p q p ?q ?p (p ?q) ??p T T T F F T F F F F F T F T F F F F T F Definition :The compound propositions p and q are called logica