Chapter1.2-Propositional_logic1(Propositional WFF and Assignment).pptVIP

  • 20
  • 0
  • 约 22页
  • 2016-12-21 发布于江苏
  • 举报

Chapter1.2-Propositional_logic1(Propositional WFF and Assignment).ppt

Now we will discuss the truth value of a wff under all possible assignments of truth values to all propositional variables contained in it. Any wff has a unique truth table. For example, for the wff ﹁p→(q∨r). We can construct the truth table in the following way: Begin, write down all possible truth values for the three letters p, q and r. This gives us a table with eight lines. Next, compute a column of values for ﹁p. Then compute a column of values for q∨r. Finally, use these two columns to compute the column of values for ﹁p→(q∨r). The final result is the following Table, from which w

文档评论(0)

1亿VIP精品文档

相关文档