01204211/activity1 logic1 - ประวัติรุ่นแก้ไข

Jittat: /* Homework 1 */

2015-08-27T01:35:24Z

Homework 1

2015-08-20T04:58:18Z

Quantifiers

2015-08-20T04:57:31Z

Quantifiers

2015-08-20T03:50:09Z

Quantifiers

2015-08-20T03:31:41Z

2015-08-20T03:30:33Z

2015-08-20T03:01:03Z

In-class activities 1

2015-08-20T02:57:52Z

In-class activities 1

2015-08-20T02:39:16Z

2015-08-20T02:17:12Z

@@ แถว 63: / แถว 63: @@
 == Homework 1 ==
-''Due: TBA''
+: ''Due: 2 Sep 2015''
 === Quantifiers ===

@@ แถว 49: / แถว 49: @@
 . For each quantified proposition you answer in question 3, find its negation and translate the negation back to English.
-  '''REMARKS: You may need to use a few equivalences to complete question 4.'''
+  '''REMARKS: You may need to use a few logical equivalences to complete question 4,'''
   '''I'll add more information on that soon.'''

@@ แถว 49: / แถว 49: @@
 . For each quantified proposition you answer in question 3, find its negation and translate the negation back to English.
-  : '''REMARKS: You may need to use a few equivalences to complete question 4.  I'll add more information on that soon.'''
+  '''REMARKS: You may need to use a few equivalences to complete question 4.'''
 . It seems that universal quantifiers are stronger than existential ones.  Is it true that for any set <math>A</math> and predicate <math>P(x)</math>,

@@ แถว 49: / แถว 49: @@
 . For each quantified proposition you answer in question 3, find its negation and translate the negation back to English.
 . It seems that universal quantifiers are stronger than existential ones.  Is it true that for any set <math>A</math> and predicate <math>P(x)</math>,
@@ แถว 58: / แถว 59: @@
 . Use a truth table to show that <math>P\Rightarrow Q</math> is equivalent to <math>\neg P\vee Q</math>.  Use this equivalence to prove that <math>P\Rightarrow Q\equiv \neg Q\Rightarrow \neg P</math>.
 == Homework 1 ==

@@ แถว 55: / แถว 55: @@
 <math>(\forall x\in A, P(x))\Rightarrow(\exists x\in A, P(x))</math>?
 </center>
 . Use a truth table to show that <math>P\Rightarrow Q</math> is equivalent to <math>\neg P\vee Q</math>.  Use this equivalence to prove that <math>P\Rightarrow Q\equiv \neg Q\Rightarrow \neg P</math>.
 == Homework 1 ==

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 03:30, 20 สิงหาคม 2558
แถว 116:		แถว 116:

	: (d) Some doctors cannot write legibly.		: (d) Some doctors cannot write legibly.
−
−	~~=== Inference rules ===~~
−
−	~~This part should be attempted after the instructor has discussed exhaustive proof technique and inference rules.~~
−
−	4. Use a truth table to prove Hypothetical syllogism. That is show that the conclusion <math>P\Rightarrow R</math> logically follows from hypotheses <math>P\Rightarrow Q</math> and <math>Q\Rightarrow R</math>.
−
−
−	~~5. Use inference rules and standard logical equivalences to show that hypotheses~~
−
−	* <math>P\Rightarrow R</math>
−	* <math>Q\Rightarrow R</math>
−
−	~~leads to the conclusion <math>(P\vee Q)\Rightarrow R</math>.~~
−
−
−	~~6. Use inference rules and standard logical equivalences to show that hypotheses~~
−
−	* <math>P\Rightarrow Q</math>
−	* <math>P\Rightarrow \neg Q</math>
−
−	~~leads to the conclusion <math>\neg P</math>.~~
−
−
−	~~7. Using inference rules to argue that if we assume~~
−
−	* <math>\neg P\Rightarrow Q</math>,
−	* <math>(P\vee R)\Rightarrow\neg S</math>,
−	* <math>W\Rightarrow S</math>, and
−	* <math>\neg Q</math>
−
−	~~then we can conclude that <math>W</math> is false.~~
−
−
−	8.
−
−
−	9.

@@ แถว 19: / แถว 19: @@
 .2 If you like Thai food, you will enjoy the trip to the Night Market.
-.3 The only way you can finish a marathon is that you practice a lot and have strong will to fight.
+.3 You can finish a marathon, only if you practice a lot and have strong will to fight.
 .4 You either learn to understand the customer or you fail to make a good product.

@@ แถว 8: / แถว 8: @@
 .2 If Harry Potter is good and you go to see it, you will have a good time.
-.3 You can have a good time, even if you do not go to see the movie Harry Potter.
+.3 You can have a good time, <del>even</del> if you do not go to see the movie Harry Potter.
 .4 If you go to see the movie Harry Potter and do not have a good time, the movie Harry Potter must be bad.

@@ แถว 1: / แถว 1: @@
 : ''This is part of [[01204211-58]].''
-== In-class activities ==
+== In-class activities 1 ==
 . Let propositions <math>P</math> = "you go to see the movie Harry Potter," <math>Q</math> = "the movie Harry Potter is good," and <math>R</math> = "you have a good time.".  Express each sentence below as a propositional form using variables <math>P,Q,</math> and <math>R</math>.
@@ แถว 56: / แถว 56: @@
 . Use a truth table to show that <math>P\Rightarrow Q</math> is equivalent to <math>\neg P\vee Q</math>.  Use this equivalence to prove that <math>P\Rightarrow Q\equiv \neg Q\Rightarrow \neg P</math>.
-== Homework ==
+== Homework 1 ==
 === Quantifiers ===

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 02:17, 20 สิงหาคม 2558
แถว 1:		แถว 1:
		+	: ''This is part of [[01204211-58]].''
		+
	== In-class activities ==		== In-class activities ==
	1. Let propositions <math>P</math> = "you go to see the movie Harry Potter," <math>Q</math> = "the movie Harry Potter is good," and <math>R</math> = "you have a good time.". Express each sentence below as a propositional form using variables <math>P,Q,</math> and <math>R</math>.		1. Let propositions <math>P</math> = "you go to see the movie Harry Potter," <math>Q</math> = "the movie Harry Potter is good," and <math>R</math> = "you have a good time.". Express each sentence below as a propositional form using variables <math>P,Q,</math> and <math>R</math>.