山东大学离散数学1知识点整理

离散数学

第一章：基础：逻辑与证明

1.1命题逻辑：Propositons Logic

1、命题Propositons:

• A       proposition      is    a     declarative(陈述的)  sentence    that      is    either   true      or false.

否定：Negation

• The  negation    of   a     proposition        p        is      denoted     by    ¬p.

合取：Conjunction

• The  conjunction      of   propositions           p            and         q            is    denoted by       p ∧ q

析取：Disjunction   

• The  disjunction of   propositions           p            and  q                   is    denoted by              p ∨q.

蕴含:Implication

• If       p            and       q            are propositions,   then  p →q   is    a     conditional statement  or implication    which   is    read     as   “if   p,    then     q     ”     

等价：Biconditional

• If       p            and       q            are propositions,   then       we  can form     the biconditional proposition  p ↔q    ,  read     as   “p          if     and       only      if     q     .”     The   biconditional p ↔q              denotes      the proposition  with      this truth    table.

1.3命题等价式

永真式：tautology

• A              tautology   is    a     proposition      which   is  always  true.
  • Example: p ∨¬p

矛盾式：contradiction

• A              contradiction   is    a     proposition      which  is    always  false.
  • Example: p ∧¬p

可能式：contingency

• A              contingency     is    a     proposition      which  is    neither a tautology nor a     contradiction

逻辑等价式：Logically   Equivalent

逻辑等价式

条件命题逻辑等价式

双条件命题逻辑等价式

1.4谓词逻辑：Predicate Logic

命题函数Proposional    Funcons

量词

全称量词：Universal Quantifier

存在量词：Existen    Quantifier

量词优先级：Precedence   of Quantifier

• The quantifiers ∀ and ∃ have higher precedence than all the logical operators.
  • For example, ∀x P(x)∨Q(x) means (∀x P(x))∨Q(x).
  • ∀x(P(x)∨Q(x)) means something different

设计量词的逻辑等价式：Equivalences  in     Predicate   Logic

1.5嵌套量词Nested    Quantifiers

• Nested quantifiers are often necessary to express the meaning of sentences in English as well as important concepts in computer science and mathematics.
  • Example: “Every real number has an additive inverse” ∀x∃y(x + y = 0)