下载此文档

华东师范大学《软件工程数学》第一章作业.doc


文档分类:研究生考试 | 页数:约5页 举报非法文档有奖
1/5
下载提示
  • 1.该资料是网友上传的,本站提供全文预览,预览什么样,下载就什么样。
  • 2.下载该文档所得收入归上传者、原创者。
  • 3.下载的文档,不会出现我们的网址水印。
1/5 下载此文档
文档列表 文档介绍
foundations:logic and Proofs 2. Which of these are propositions? What are the truth values of those that are propositions? a) Do not pass go. b) What time is it? c) There are no black flies in Maine. d)4+x=5. e) The moon is made of green cheese. f)2 n≥100. 4. Let p and qbe the propositions p:I bought a lottery ticket this week. q:I won the million dollar jackpot on Friday. Express each of these propositions as an English sentence. 6. Let p and q be the propositions "The election is decided" and "The votes have been counted," respectively. Express each of pound propositions as an English sentence. 8. Let p, q, and r be the propositions p: You have the flu. q: You miss the final examination. r: You pass the course. Express each of these propositions as an English sentence. 12. Determine whether these biconditionals are true or false. a)2+2=4 if and only if1+1= 2. b)1+1=2 if and only if2 +3= 4. c)1+1=3 if and only if monkeys can fly. d)0>1 if and only if2 > 1. 30. Construct a truth table for each of pound propositions. 32. Construct a truth table for each of pound propositions. 4. Use truth tables to verify the associative laws 10. Show that each of these conditional statements isa tautology by using truth tables. 14. Determine whether tautology. 28. Show that are logically equivalent. 30. Show that isa tautology. 60. Which of pound propositions are satisfiable?

华东师范大学《软件工程数学》第一章作业 来自淘豆网m.daumloan.com转载请标明出处.

非法内容举报中心
文档信息
  • 页数5
  • 收藏数0 收藏
  • 顶次数0
  • 上传人Q+1243595614
  • 文件大小265 KB
  • 时间2017-04-19