UNIT 2: A DISCUSSION ON FUNDAMENTALS OF LOGIC

Size: px
Start display at page:

Download "UNIT 2: A DISCUSSION ON FUNDAMENTALS OF LOGIC"

Transcription

1 UNIT 2: A DISCUSSION ON FUNDAMENTALS OF LOGIC Introduction: Logic is being used as a tool in a number of situations for a variety of reasons. Logic is found to be extremely useful in decision taking problems. In computer science and engineering, knowledge of logic is essential in in the following field: Analysis of algorithms and implementation Development of algorithms into a structured program in a programming language. A material of logic theory forms a basis in theoretical computer science such as Artificial Intelligence, Fuzzy logic, functioning of expert systems etc. Many times while working on a project after the beginning steps, we always have a doubt regarding whether the direction followed is right or wrong? Are we doing the job correctly? Whether the decisions taken are correct or incorrect etc? It is here logic plays an important role; using which one can solve a problem with lot of confidence and satisfaction. With these few remarks, the next sections introduce formal symbolic logic. Basic Terminologies of logic: A Proposition is a declarative sentence written in some language, usually English, which is either true or false, but not both (i.e. true and false) at the same time. It is also referred as a simple statement or primitive proposition or an atomic statement. A proposition is denoted by using lower case letters such as p, q, r, s etc. Every proposition has exactly one of the two truth values; either true or false. When it is true, the same is assigned a symbol T or 1. If the primitive statement is false, it is assigned the symbol F or 0. In view of this, a proposition may be defined as a pair either (p, T) or (p, F). This situation may be compared to what we discussed earlier in set theory. It is seen that with respect to a set A and an element x, there are only two options; either x is an element of A or x need not be an element of A. There too we used the numbers 1 and 0 to describe the situation. The following are examples of propositions: p: Dr. Manmohan Singh is the president of India. q: Mumbai is the financial capital of India r: Bangalore is the silicon valley of India. s: 3+3=5

2 t: Dr. Abdul Kalam was awarded Bharath Rathna What about the following? x+3 is an integer. Please come in! Are u alright? Complete work today itself What are you doing? What a beautiful evening! These are not considered as propositions. Because, x + 3 is an integer cannot be a proposition, as x is not specified. A statement of this kind is called an open statement. the statement gets a meaning only when x is assigned a value chosen from the universe of discourse of the problem considered. Others are either commands, or enquiries, or exclamatory sentences. These are not referred to as non-propositions. Discussion of various logical connectives Negation: Let p be a proposition. It is not the case that p is called as negation of the p. Simply, it is NOT p. This is denoted by the symbol Ø p. This situation can well be explained by using a truth table which is shown below: p Øp p Øp T F 1 0 F T 0 1 Disjunction or logical OR: Let p and q be simple propositions. A proposition obtained by combining p and q using logical OR is called p disjunction q. It is denoted by p Ú q. The truth value of p Ú q is false only when both p and q are false, otherwise, p Úq is a true proposition. This is explained in the truth table given below. p q p Úq T T T T F T F T T F F F Note: Logical operator is similar to the union operator in the case of set theory. Conjunction or logical AND:

3 Let p and q be simple propositions. A proposition obtained by combining p and q using logical AND is called p conjunction q. It is denoted by p Ù q. The truth value of p Ù q is true only when both p and q are true otherwise p Ù q is a false proposition. The same is explained in the truth table given below. p q p Ùq T T T T F F F T F F F F Note: Logical operator is similar to the intersection operator in the case of set theory. Also, logical OR and logical AND have dual characteristics. Thus, conjunction and disjunction are examples of dual operators. One sided implication or logical IMPLICATION or IF THEN : Let p and q be simple propositions. A proposition obtained by combining p and q using logical connective, namely, one sided IMPLICATION is called p implies q. It is denoted by p q. The truth value of p q is false only when p is true but q is a false proposition. In all other instances, p q is a true statement. The truth table is given below. p q p q T T T T F F F T T F F T Few examples: If 3+3=7, then Sunday is a Christmas is a holiday. If 3+2 = 5, then sun raises in the east. If tomorrow is Monday, then yesterday was Saturday. If 32 7 = 23, then = 9. Note: p implies q can be explained in many ways. 1. if p then q

4 2. p is sufficient for q 3. q is necessary for p 4. p only if q Bi-conditional or two sided implication OR IF AND ONLY IF or IFF: Let p and q be two simple propositions. p Bi-conditional q is a compound proposition denoted by the symbol p q. he truth value of p q is true only when both p and q are assigned the same truth value; otherwise, its truth value is false. p q p q T T T T F F F T T F F F Note: Here, p is necessary and also sufficient for q. p bi-conditional q is to be read as p if and only if q. Exclusive logical OR: Consider two propositions, say, p and q. Then p exclusive or q is a compound proposition whose true value is false when both p and q have the same truth values. Otherwise, the truth value is true. It is denoted by pú q. The truth table is given below. p q púq T T F T F T F T T F F F Note: This logical operator is similar to the symmetric difference operation for sets. NAND logical connective: This is defined as negation of and p q, denoted by ( p q) Ø Ù or by p - q. NOR logical connective:

5 This is defined as negation of p or q, denoted by ( p q) Ø Ú or by ( p q) Ø. p q p q Ù ( ) : Ø pùq p - q p q Ú ( ) : Ø púq p - q : T T T F T F T F F T T F F T F T T F F F F T F T Note: NAND and NOR are examples of dual logical operators. A discussion on statement formula, Tautology, Contradiction and Contingency A proposition obtained by combining many logical variables (i.e. propositions when not specified) using a number of logical connectives, and, containing proper parentheses is called a statement formula or simply a statement. For example, the following are statement formulas: pù [( q r) ÚØ q] ( pù q) [( q r) Ú( Øq ÙØ s)] ( p q p ) r) is not Ø Ù Ø Ú a valid formula. ( ) ( ) Note: It may be noted each logical variable has two possible truth value assignments; True or False. Thus, if a statement formula contains n logical variables, then there are Hence, the truth table of the formula will contain What is meant by Tautology? n 2 rows. Consider a statement, say n 2 choices. A : A( p p p... p, Ù, Ú,,, Ø). If for each of the 2 k options, truth value of A turns out 1, 2, 3, k, to be true, then A is called a tautology, or as universally accepted formula, or as universally valid formula, Thus, if a statement formula A is always true, then it said to be a tautology. Suppose, the truth value of A is always false, then it is called an absurdity, or contradiction, or universally invalid formula. On the other hand, if the truth value of A is some times true and at others false, then it is called contingency. Illustrative examples: By constructing the truth table of the following, determine which one is a tautology? Which one is a contradiction? Which is one a contingency?

6 1. ( p q) ( Øp Úq) 2. ( p q) ( Ø q Øp) [ ] 3. p Ù ( p q) q 4. ((p q) ÙØ q) Ø p ( p q Ù q r ) ( p r) 5. ( ) ( ) Solution to problem number 1( p q) ( Øp Úq) p q A : p q Ø p B : Øp Ú q A B T T T F T T T F F F F T F T T T T T F F T T T T ( q) «( Øp Ú q) Therefore, p is a Tautology Solution to problem number: 2. ( p q) ( Ø q Øp) p q A : p q Ø p Ø q B : Ø q Ø p A B T T T F F T T T F F F T F T F T T T F T T F As A : p F T T T T T q and B : Ø q Ø p have same set of truth values, therefore, p q and Ø q Ø p are logically equivalent to each other. Therefore, if a situation demands, the formula p q may well be replaced byø q Ø p. Solution to problem number 4:

7 p q p q q T T F F Ø : ( ) A p q ÙØ q Ø p A Ø p T T F F F T F F T F F T T T F F T T F T T T T T Since, ((p q) ÙØ q) Ø p is a tautology, and Thus, ((p q) ÙØ q) Ø p is a tautology. Logically equivalent statements Two statement formulas A and B are said to be logically equivalent, whenever A B is a tautology. Equivalently, if A and B have same set of truth values for each of the truth value assignments to the components of A and B. We denote this by AÛ B. By constructing truth table, determine whether the following are logically equivalent? 1. púq and [( p Ù Øq) Ú ( Øp Ù q)], 2. ( Øp Úq) Ù( p Ù( p Úq)) and p Ù q 3. Ø( p - q) and ( Øp Ø q) 4. p ( q Ú r)) and ( p ÙØ q) r) Solution of Problem No. 1. Consider the following truth table showing truth values of both the formulas p q púq Øp Ø q : A pùø q B : Øp Ùq AÚ B T T F F F F F F T F T F T T F T F T T T F F T T F F F T T F F F

8 From the table, it is clear that púq and [( p Ù Øq) Ú ( Øp Ù q)] are logically equivalent. Solution of Problem Number 3: Consider the following truth table p q p Ù q Ø( pùq) : ( p - q) Ø( p - q) Øp Øq Øp ÚØ q Ø( ØpÚØq) : Øp Øq T T T F T F F F T T F F T F F T T F F T F T F T F T F F F F T F T T T F From the above table, it follows that Ø( p - q) and ( Øp Ø q) are logically equivalent. Tutorial on fundamentals of logic Let p, q, r, s denote the following statements p : I finish writing my computer program before lunch q : I shall play tennis this afternoon r : The sun is shining s : The humidity is low Write the following statements in symbolic form: (a) If the sun is shining, I shall play tennis this afternoon. (b) Finishing the writing of my computer program before lunch is necessary for my playing tennis this afternoon. (c) Low humidity and sunshine are sufficient for me to play this tennis this afternoon. Solution: ( ) (b) (c) ( ) a r q p q sù r q 2. Determine the truth value of each of the following: (i) (ii) (iii) If = 12, then = 6. (True) If = 6, then = 9. (False) If George Bush was the third president of USA, then = 5. (True) 3. Rewrite the following statements as an implication in the form if... Then.. form.

9 (a) For practicing her serve daily is a sufficient condition for Ms. Sania Mirza to have a good chance of winning the Australian Open tennis tournament. (b) Fix my air-conditioner or I won t pay the rent. (c) Manavi will be allowed to sit on Mohan s motor bike only if she wears her helmet. Solution :( a) If Ms. Sania Mirza practices her serve daily, then she will have a good chance of winning the tennis tournament. (b) If you do not fix my air-conditioner, then I shall not pay the rent. (c) If Manavi is to be allowed on Mohan s motor bike, then she must wear her helmet Determine all truth value assignment, if any, for the primitive statements p, q, r, s, t that make each of the following statements false. [ pùq Ù r] ( sút) [ pùq Ù r] ( sú t) (a) ( ) (b) ( ) Solution: For (a), the implication is given to be a false one, therefore, we must have ( pùq) Ù r as true, and s Ú t as false. Thus, truth values of these primitive statements are: Primitive statements p q r s t Truth values T T T F F (b) The implication is given to be a false; we must have ( pùq) Ù r as true and sú t as false. Thus, truth values of these primitive statements are: Primitive statements Truth values p q r s t T T T T T T T T F F If statement q has the truth value 1, determine all truth value assignments for the primitive statements p, r, and s for which the truth value of ( q [( Øp Úr) ÙØs]) Ù[ Ø s ( Ør Ù q)] is 1. Solution: We shall setup A : ( q [( Øp Úr) ÙØs]), B :[ Ø s ( Ør Ù q)]. Note that we are given that AÙ B is true (i.e. 1), therefore, it follows that both A and B are true statements. It is given that q has the truth value 1, it is clear that truth value of ( ØpÚ r) ÙØ s is 1, otherwise, the implication becomes false, which is not true actually. From this we infer that Øp Úr and Ø s

10 are true statements. Thus, truth value of s is true. We do have that B :[ Ø s ( Ør Ù q)] is true, so it follows that Ø r is true, and so truth value of r is false. With Øp Ú r being true, w must have p as false. Hence, conclusion is that if A : ( q [( Øp Úr) ÙØs]), B :[ Ø s ( Ør Ù q)] is true, then we truth value assignments of p, q, r, and s are: Primitive statements p q r s Truth values F T F F In the following program segment, I, j, m, and n are integer variables. The values of m and n are supplied by the user earlier in the execution of the total program. for i : = 1 to m do for j : = 1 to n do if i ¹ j then pr int i * j How many times the print statement in the segment is executed when ( a) m = 10, n = 10 ( b) m = 20, n = 20 ( c) m = 10, n = 20 ( d) m = 20, n = 10 Solution: (a) For m = 10, n = 10, print statement will be executed only for 90 times. (b) For m = 20, n = 20, print statement will be executed only for 380 times. (c) For m = 10, n = 20, print statement will be executed only for 190 times. (d) For m = 20, n = 10, print statement will be executed only for 180 times Negate and express the following statements in smooth English. (c) If Harold passes his C++ course and finishes his data structures project, then he will graduate at the end of semester. Solution: let us set up p: Harold passes C++ course, q: Harold finishes his data structures project, r: Harold becomes a graduate at the end of semester. Symbolically, the given statement may be written as ( pù q) r. The negation of this statement is

11 (( ) é ) ( ) Ø p Ù q r Û Ø Ø p Ù q Ú r ù ë û, since A B Û Ø A Ú B Applying De-Morgan laws, we obtain ( Ù ) p q ÙØ r. Thus, the negated statement in English is Harold passes C++ course and Harold finishes his data structures project but fails to graduate at the end of semester. Concept of Duality in logic: Given a statement formula involving a number of primitive statements and several logical connectives, its dual may be obtained just by replacing conjunction ( Ù ) by disjunction ( Ú ) and vice versa, not disturbing other logical connectives. If the formula contains special symbols like T or F, then these are to be replaced by F and T respectively. ( a) q p, (b) p qù r, (c) p «q Write the dual of the following: ( ) Solution: Consider ( a) q pû Øq Ú p, therefore, its dual is Øq Ù p. Consider (b) p ( qùr) Û Øp Ú( qù r), therefore, the respective dual is p ( q r) Consider (c) p «qû ( p q) Ù ( q p) ( p q) ( q p) Thus, the dual is ( ØpÙq) Ú( Øq Ù p). Û Ø Ú Ù Ø Ú. Concept of converse, inverse and contra positive statements: For the statement p For the statement p For the statement p q, q p is called the converse statement. q, Ø p Ø q is called the inverse statement. Ø Ù Ú. q, Ø q Ø p is called the contra-positive statement Write the converse, inverse and contra -positive of the statement If today is a labor day, then tomorrow is Tuesday. Solution: The converse statement is If tomorrow is Tuesday, then today is Labor Day. The inverse statement is If today is not Labor Day, then tomorrow is not Tuesday. The contra-positive statement is If tomorrow is not Tuesday, then today is not Labor Day

12 Laws of logic: With respect to conjunction (i.e. logical AND), Ù pù pû p (idempotent law) pùqû qù p (Commutative law) ( pùq) Ùr Û pù( q Ùr) pùf Û F (identity law) pùt Û p(universal law) pùøpû ØpÙ pû F (Associative law) Thus, ( a set of propositions, Ù ) is a discrete structure Laws of logic: With respect to disjunction i.e. (logical OR), Ú pú pû p (idempotent law) púqû qú p (Commutative law) ( púq) Úr Û pú( qúr) pú F Û p(identity law) pút Û T(universal law) púøpû Øp Ú pû T ( Ú) (Associative law) Thus, a set of propositions, is a discrete structure With respect to combination of conjunction operator i.e. logical AND operator ( Ù ) and disjunction operator i.e. logical OR ( Ú ), we can generate distributive laws. Thus, ( P, Ú, Ù ) is another discrete structure where P denotes the set of all propositions. ( pùq) Úr Û ( púr) Ù( q Úr) ( púq) Ùr Û ( pùr) Ú( q Ùr) (Distributive law) (Distributive law) If the operators Ú, Ù and Ø are combined then, we obtain ( ) ( ) ( p) Û Ø púq Û Øp ÙØq (De - Morgan law) Ø pùq Û Øp ÚØq (De - Morgan law) Ø Ø p (double negation law) Therefore, one can claim that ( P, Ú, Ù, Ø ) is a discrete structure. Ø[ Ø[ púq Ùr] ÚØq] using laws of logic only. Also, state the law used in the Simplify ( ) derivation..

13 Solution: We shall use De-Morgan law, Double negation law, and Associative law and Absorption law to simply the above expression. Consider ( ) ( ) é ( ) Ø [ Ø [ púq Ùr ] ÚØq ] Û ØØ p q r qù ë Ú Ù Ù û because ØØAÛ But (( ) ) Û é p Ú q Ù r Ù q ù ë û A [By Double Negation Law] Û é( ( p q ) q ) r ù ë Ú Ù Ù û (By associative law) (( púq) Ùq) Û q by Absorption Law. Therefore, ( ) Ø[ Ø[ púq Ùr] ÚØq] Û qù r. Discussion on Methods of Proof: Note: A statement which is given to be true or just true is called as a premise. Now, consider a set of premises H1, H 2, H 3,... H k. Let C be a conclusion of some argument. We say that k premises implies the conclusion C whenever (... k) H1 Ù H2 Ù H3 Ù Ù H C is a tautology. Symbolically, we describe it as (... k) H1 Ù H2 Ù H3 Ù Ù H Þ C and read it as C follows logically from all the k premises or the k premises C logically. Determine whether the following argument is logically valid? H1: If you invest in stock market, then you will get rich. H2: If you get rich, then you will be happy, Conclusion: Therefore, If you invest in stock market, then you will be happy. Solution: We shall set up: p : You invest in stock market, q : You will become rich and r : You will be happy. Then, problem may be formulated symbolically as H1 : p q, H 2 : q r therefore C : p r. Here, the problem is to determine whether ( ) ( ) H1 Ù H2 Þ C i.e. H1 Ù H2 C is a tautology? As 3 variables are involved, one can adopt truth table method. p q r H : p q 1 : H2 q r H Ù H 1 2 : C p r H Ù H C ( 1 2 ) T T T T T T T T T T F T F F F T T F T F T F T T

14 F T T T T T T T T F F F T F F T F T F T F F T T F F T T T T T T F F F T T T T T H1 Ù H2 C is a tautology, therefore, it may be concluded that this is a valid Since ( ) argument. Determine whether the following argument is logically valid? H1: If I try hard and I have talent, then I will become a musician. H2: If I become a musician then I will be happy. H3: I have not become happy. Therefore, I did not try hard or I do not have talent. Solution: First we shall set up the following simple statements, namely, p : I try hard, q : I have talent, r : I become a musician and s : I became happy. Then given premises may be written in symbolical form as ( ) H1 : pù q r, H2 : r s, H3 : Øs and the conclusion as C : Øp ÚØq Here, to find whether ( H1 Ù H2 Ù H3) Þ C or whether ( ) H Ù H Ù H C a tautology? Observe that this problem involves 4 logical variables. Therefore, truth table approach may not be proper as it is required to construct a table of 16 rows. This is not feasible, thus, there is a necessity to develop alternate strategies. With this in view, we shall now introduce rules of inference theory. Rule 1: A given premise (i.e. a statement which is given to be true in the problem can be used at any stage during the argument.

15 Rule 2: An statement can be replaced by means of an equivalent statement. This is permitted. For example the statement p q can be replaced as either by ØpÚq or by Ø q Ø p. Rule 3: In conditional proof, for example, if a problem to determine whether A B and if nothing is told about the nature of A is given, then we can introduce an additional premise in the problem by H : A i.e. A is true. Rule 4: Modus ponens: Whenever p is true, p implying q is true, then q is certainly true. Symbolically it is given as p, p q q is a tautology. pù p q q Þ. We can verify that ( ) Rule 5: Modus Tollens: Whenever p q is true and Ø q is true, then Ø p is true. Symbolically, it is given as Ø q, p q Þ Ø p. One can verify that ( ) é q p q ù ëø Ù û Øp is a tautology. Rule 6: Law of Syllogism: Whenever p q is true and q r is true, then p r is true. Symbolically, same can be written as é( p q) Ù ( q r) ùþ ( p r) Rule 7: Law of Conjunction ( pùq) Þ p Rule 8: Law of Disjunction - p Þ ( pú q). ë û. Now, we shall use the rules of inference theory. Consider the premises H1 and H2, i.e. 1 : ( Ù ) and 2 : r. Applying the law of syllogism, we obtain :( ) H p q r H s Now consider ( ) R1 pù q s. R1 : pù q s and H : Øs ; using the law of Modus Tollens, we should get 2 : Ø( Ù ). But it is known that ( ) R p q valid. 3 Ø pùq Û Øp ÚØ q. Hence, argument is logically Determine whether the following argument is valid? H1: If Haripriya gets the supervisor position and works hard, then she gets a raise. H2: If she gets a raise, then she will buy a new car. H3: She has not purchased a new car. Conclusion: Either Haripriya did not get the supervisor s position or she did not work hard Solution:

16 First we shall set up p: Haripriya gets the supervisor s position. q: Haripriya works hard. r: She gets the raise. s: She purchase a new car. Then, then given premises can be written in symbolic H 1 : pù q r, H2 : r s, H3: Øs C : Øp ÚØq. Consider the premises H3 and H2, form as ( ) namely, H2 : r s and H3: Ø s. Applying the rule of Modus Tollens, we obtain the result R1: Ø r. Now consider the premise H1 and the result just obtained R1, viz., 1 ( pù q) r Ør. Again using the rule of Modus Tollens, we should get R : Ø( pùq) H :, R1: It is well known that Ø( pùq) Û Øp ÚØ q. Hence, the given argument is logically valid. 2. Determine whether the following argument is valid? If the band could not play rock music or the refreshments were not delivered on time, then the New Year s party would have been cancelled and Anita would have been angry. If the party were cancelled, then refunds would have had to be made. No refunds were made. Therefore, the band could play rock music. Solution: First we shall form the following primitive statements: p : The band could play rock music, q : The refreshments were delivered on time r : New year party is cancelled, s : Anitha has become angry, t : Refunds had to be made Then, the given premises may be written in symbolic form as H1 : ( Øp ÚØ q) ( r Ù s), H2 : r t, H3 : Øt and C : p. Here, to determine whether ( ) H1Ù H2Ù H 3 p is a tautology? As 5 parameters are involved in this problem, we shall use the rules of inference theory. Consider the premises H3 and H2, namely, H2 : r t and H3 : Øt. Using Modus Tollens here, we will get the result that R1 : Ør. Equivalently, we have got that negation of r is true. Therefore, we must have that truth value of r as false. Due to this, it is clear that truth value of r Ù s is false. But according to H1 : ( Øp ÚØ q) ( r Ù s), i.e. this implication is true. From here, it follows that truth value of ( ØpÚØ q) is false. But this is possible only when both Øp and Øq are false. Thus, we obtain that truth value of p and q as true. Hence, given argument is logically valid. Determine whether the argument is valid?

17 ( ) ( ) ( ) H1 : p r Ù s, H2 : p q, H3 : q r Ù s, H4 : Ør Ú Øt Úu, H5 : pùt imply the conclusion C : u? Argument: Consider H 5 : pùt. Using law of conjunction, we get that the primitive propositions p and t are both true. Equivalently the truth value of and H3, namely, : p q : q ( r Ù s) ( ) Ø t is false. To consider H2 H2, H3, using the law of syllogism, we get the result R1 : p r Ù s. With p being a true proposition, applying Modus Ponens, we obtain R2 : r Ù s as a true statement. Thus, truth value of both r and s are true. Equivalently, the truth value of negation of r is false, i.e. Already, we have obtained that (i) Ø r is false. According to H4, we have Ør Ú( Øt Ú u) is true. Ø t is false and (ii) Ø r is false, so only option left for us to conclude is truth value of u is true. Hence, the given argument is logically valid. Determine whether the argument is valid? ( ) H1 : u r, H 2 : ( r Ù s) ( pú t), H 3 : q uù s, H4 : Øt Imply the conclusion C : q? Solution: Note that this problem is based on conditional proof. However, nothing is given about the nature of the primitive proposition, q. Thus, we shall introduce an additional premise namely, i.e. q is a true proposition. Consider the premises H3 and H5 i.e. q q ( uù s) applying the rule of Modus Ponens, we get the result R :( uù s) p H5 : q and, 1. Using the law of conjunction we obtain R2: u and s i.e. both u and s are true statements. Now using the result R2 and the premise H1, i.e. R2: u, H1 : u r and the rule of Modus Ponens, we will get R3 : r. As r and s are true propositions, r Ù s is a true statement. Using this and H2 : ( r Ù s) ( pút) we get ( p Ú t) is a true statement. We know that pút Û t Ú pû Ø t p. Using H4: Øt here, and applying once again rule of Modus Pones, we should get that p is a true proposition. Hence the given argument is logically valid.

18 Discussion of Direct Proof and Indirect Proof Let n be a positive integer. Prove that n 2 is odd if and only if n is odd. Proof: It is known that an odd integer may be written as n = 2k + 1, where k Î Z squaring both sides, ( ) ( ) n 2 = ( 2k + 1) 2 = 4k 2 + 4k + 1 =2 2k 2 + 2k + 1 =2m + 1 where m = 2k 2 + 2k, an integer Thus, n 2 is odd. To prove the converse, we shall give an indirect proof. To begin with let n 2 be an odd integer. To prove that n is odd. Suppose on the contrary that let n be an even integer. Then we can write as n k = 2 so that n = ( k) = k = ( k ) an even integer. But this is against our hypothesis that n 2 is odd. Hence, we conclude that n is an odd integer. Prove that if 3m + 2 is an odd integer, then m is an odd integer. Proof: Observe that 3m + 2 = 2k + 1, therefore 3m = 2k -1, an odd integer. Now, we have 3 m an odd integer. From this, we must conclude that m is odd, otherwise ( ) 3m + 2 = 3 2k + 2 = 6k + 2 = 2( 3k + 1 ), an even integer. this is impossible as it is given that 3m + 2 is an odd integer. Hence our assumption that m is even is wrong and so m must be an odd integer. Let n be an integer. Prove that n is even if and only if 31n + 12 is even. Proof: Suppose that n is an even integer, Thus, n = 2 k, where k is an integer. Therefore, 31n + 12 = 31 2k = 62k = 2 ( 31 k) is even. On the other hand suppose that 31n + 12 is even. To prove that n is an even integer. We shall prove this by giving an indirect proof. Suppose on the contrary, let n be odd. Then we can write n = 2k + 1, where k is an integer. Thus, ( ) ( ) 31n + 12 = 31 2k = 62k + 43 = 62k = 2 31k = 2m + 1 where m = 31k + 21 is an odd integer which is impossible as we ourselves had assumed that n is even. Hence, n must be an even integer. A discussion on Predicates and Quantifiers So far study was confined to a set of simple, primitive propositions or compound statements only. We discussed various concepts such as logical connectives, formation of compound proposition, tautologies, contradiction, and contingency. Also, we discussed logical equivalence of statements, duality of a formula etc.

19 Further, rules of inference theory were introduced using which problems based on logical arguments were examined. Now we shall initiate a discussion on predicates and quantifiers. Before understanding these, consider the following statements, Dog is an animal Cat is an animal Elephant is an animal Tiger is an animal Lion is an animal Deer is an animal Horse is an animal and the list go on Observe that all these statements are about individuals which are animals, so to study these; we require different symbols to denote these animals. But even the usage of different symbols, does not show the common property of the symbols, that each symbol denotes an animal. Suppose if we want to describe all the animals of the universe, then certainly a large number of symbols are necessary. To deal with a situation of this type, it is appropriate to develop a mechanism using which it must be possible represent all the common feature of the objects. The following section is devoted to the same. First we introduce a symbol to denote the phrase is an animal and secondly, a technique to joint it with a symbol representing an animal, then we are done as this single expression will speak about all the individuals which are animals. Here, the part is an animal is called as predicate. Usually, a predicate is represented by using upper case letters and lower case letters are considered for the objects associated with a predicate. Thus, let us consider A : is an animal then all objects which are animals may be expressed as A( x) where x is a variable to be chosen from the universe of discourse, namely, the set of animals. A( x ) to be read as x is A or as object has the property stated in the predicate,. Since only one variable is involved here, A( x ) is said to be 1 place predicate function or as an open statement of a single variable. Similarly 2 place, 3 place predicates can be introduced. The study of predicate functions constitutes predicate calculus. Thus, it is clear that all the topics discussed under fundamentals of logic can be extended to predicates calculus. Therefore, one may combine the open statements using the logical

20 connectives, one can extend the definitions like logical equivalence, tautology etc to these. Please remember that the set of all objects is called as universe of discourse or just universe. A note on Quantifiers In a practical situation, we come across a number of quantified statements like Live lectures through EDUSAT programme is open for all engineering college students in Karnataka A vehicle having Karnataka state permit is permitted to move on any road in the state. There are some bad boys in a class room. Some students never follow Discrete Mathematics course whoever teaches this course. There is at least one student in some engineering watching this programme coming live from VTU studio, Bangalore. Pythagoras Theorem holds well for all right angled triangles and the list go on. Statements shown in previous slides can be expressed symbolically using quantifiers. There are two types of quantifiers: 1. Universal quantifier: A statement which is universally valid may be explained using an universal quantifier. This is similar to the situation, namely, for all, for every and for any etc. Symbolically, it is denoted as ". Consider an open statement p( x) which is true for all substitutions from a universe of discourse, then the same may be written in symbolic form as " x p( x). 2. Existential Quantifier: There are statements which are true only under circumstances. These statements may be symbolically expressed in terms of existential quantifier, denoted by$. Consider an open statement of the form q( x ). values of x. This may be symbolically written as $ x q( x). Suppose that this statement is true only for some Note: An open statement of the form q( x ) gets A meaning only when x is replaced by a proper value from the universe or universe of discourse, denoted by U. Examples: Examples: Consider universe of discourse as the set of all days of a week. Then U = {Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, Saturday}. Consider the statement p( x) : x is a holiday. It is known that there is a day in a week which is declared as a general holiday (i.e. Sunday), thus, this situation may be written as $ x p( x)

21 Another example; Take the universe as the set of all flowers and consider the statement, Flowers are beautiful. To write this statement in symbolic form, we shall set up f ( x) : x is a flower, then above may be written symbolically as " x f ( x).. Some important remarks: The statement " x f ( x) assumes the truth value false even if for one value of x, f ( x ) is false. Therefore, we have the result [ ] Ø " x f ( x) Û $ x Ø f ( x). Similarly, the statement $ q( x) will take the truth value false, only when for all values of x the statement q( x ) is false. Hence, we obtain [ ] Ø $ x q( x) Û " x Ø q( x). Also, the following are some of important remarks regarding predicates and quantifiers. $ x [ p( x) Ùq( x) ] Û [ $ x p( x) Ù$ x q( x) ] $ x [ p( x) Úq( x) ] Û [ $ x p( x) Ú$ x q( x) ] " x [ p( x) Úq( x) ] Û [" x p( x) Ú" x q( x) ] [" x p( x) Ú" x q( x) ] Þ " x [ p( x) Ú q( x) ] Also, we have the following results to negate the statements with one quantifier: Ø " x p( x) Û $ x Ø p( x) [ ] Ø $ x p( x) Û " x Ø p( x) [ ] Ø " x Øp( x) Û $ x ØØp( x) Û $ x p( x) [ ] Ø $ x Øp( x) Û " x ØØp( x) Û " x p( x) [ ] Tutorial on Quantifiers: For the universe of integers, let p( x), q( x), r( x), s( x), t( x ) be the following open statements. p( x) : x > 0 q( x) : x is even r( x) : x is a perfect square s( x) : x is exactly divisible by 4 t( x) : x is exactly divisible by 5

22 Write the following statements in symbolic form: (i) At least one integer is even. (ii) There exists a positive integer that is even. (iii) If x is even, then x is not divisibly by 5. (iv) No even integer is divisible by 5. (v) There exists an even integer divisible by 5. (vi) If x is even and x is a perfect square, then x is divisibly by 4. Solution: i ) $ x q( x) ( ii ) $ x [ p( x) Ù q( x) ] ( iii ) " x [ q( x) Øt( x) ] [ ] [ ] é ë( ) (iv) " x Ø q( x) t( x) ( v) $ x q( x) t( x) ( vi) " x q( x) Ù r( x) s( x) ù û Translate each of these statements into logical expressions using predicates, quantifiers and logical connectives: (i) Some students do not follow the rules. (ii) Some students are very serious. (iii) No student can keep a secret. (iv) There is some in this class who is very intelligent Solution: Let us consider the universe as the set of all students of a college. First we shall set up the following primitive statements p( x) : x follows the rules. q( x) : x is a very serious person. r( x) : x can keep secret. s( x) : x is very intelligent. Solution: ( i ) $ x Ø p( x), ( ii) $ x q( x), ( iii ) " x Ø r( x). (iv) $ x s( x) For the universe of all integers, determine the truth or falsity of each of the following statements. If a statement is false, give a counter example. p( x) : 2 x - 8x + 15 = 0, q( x) : x is odd, r( x) : x > 0. [ ] [ ] [ ] ( a) " x p( x) q( x), ( b) " x q( x) p( x), ( c) $ x p( x) q( x) [ ], [ ] é ë( ) d) $ x q( x) p( x) ( e) $ x r( x) p( x), ( f ) " x p( x) Ú q( x) r( x) ù û ( ) ( g) $ x é p( x) q( x) Ùr( x) ù ë û

23 Solution: The quadratic equation x 2-8x + 15 = 0 may be factorized as ( x - 3) ( x - 5) = 0. Thus, roots are x = 3, x = 5. as both the roots are odd, it is clear that statement (a) is true. According to statement (b) if x is an odd integer, then it is a solution of the quadratic equation x 2-8x + 15 = 0. This is a false statement, for, x = 1, an odd integer is not a root of the quadratic equation. (c) The English version of this statement is that there is a solution of x 2-8x + 15 = 0 which is odd. As the roots are 3 and 5, which are odd, therefore, (c) and (d) are both true statements. According to statement (e), there is a positive integer which is also a root of the quadratic equation x root. Statements (f) and (g) are both true. 2-8x + 15 = 0. This is true because x = 3 a positive integer and is a

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1) CS100: DISCREE SRUCURES Lecture 5: Logic (Ch1) Lecture Overview 2 Statement Logical Connectives Conjunction Disjunction Propositions Conditional Bio-conditional Converse Inverse Contrapositive Laws of

More information

Propositional Logic. Spring Propositional Logic Spring / 32

Propositional Logic. Spring Propositional Logic Spring / 32 Propositional Logic Spring 2016 Propositional Logic Spring 2016 1 / 32 Introduction Learning Outcomes for this Presentation Learning Outcomes... At the conclusion of this session, we will Define the elements

More information

Chapter 1: The Logic of Compound Statements. January 7, 2008

Chapter 1: The Logic of Compound Statements. January 7, 2008 Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive

More information

Discrete Structures of Computer Science Propositional Logic III Rules of Inference

Discrete Structures of Computer Science Propositional Logic III Rules of Inference Discrete Structures of Computer Science Propositional Logic III Rules of Inference Gazihan Alankuş (Based on original slides by Brahim Hnich) July 30, 2012 1 Previous Lecture 2 Summary of Laws of Logic

More information

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations Logic Propositions and logical operations Main concepts: propositions truth values propositional variables logical operations 1 Propositions and logical operations A proposition is the most basic element

More information

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS 1.1 - Logical Form and Logical Equivalence Definition. A statement or proposition is a sentence that is either true or false, but not both. ex. 1 + 2 = 3 IS a statement

More information

PROPOSITIONAL CALCULUS

PROPOSITIONAL CALCULUS PROPOSITIONAL CALCULUS A proposition is a complete declarative sentence that is either TRUE (truth value T or 1) or FALSE (truth value F or 0), but not both. These are not propositions! Connectives and

More information

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares

More information

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

2. The Logic of Compound Statements Summary. Aaron Tan August 2017 2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional

More information

DISCRETE MATHEMATICS BA202

DISCRETE MATHEMATICS BA202 TOPIC 1 BASIC LOGIC This topic deals with propositional logic, logical connectives and truth tables and validity. Predicate logic, universal and existential quantification are discussed 1.1 PROPOSITION

More information

Chapter 1 Elementary Logic

Chapter 1 Elementary Logic 2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help

More information

Logic, Sets, and Proofs

Logic, Sets, and Proofs Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.

More information

Logic Overview, I. and T T T T F F F T F F F F

Logic Overview, I. and T T T T F F F T F F F F Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical

More information

Review. Propositional Logic. Propositions atomic and compound. Operators: negation, and, or, xor, implies, biconditional.

Review. Propositional Logic. Propositions atomic and compound. Operators: negation, and, or, xor, implies, biconditional. Review Propositional Logic Propositions atomic and compound Operators: negation, and, or, xor, implies, biconditional Truth tables A closer look at implies Translating from/ to English Converse, inverse,

More information

CSC Discrete Math I, Spring Propositional Logic

CSC Discrete Math I, Spring Propositional Logic CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)

More information

10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference

10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference Logic? Propositional Logic (Rosen, Chapter 1.1 1.3) TOPICS Propositional Logic Truth Tables Implication Logical Proofs 10/1/12 CS160 Fall Semester 2012 2 What is logic? Logic is a truth-preserving system

More information

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic Discrete Mathematical Structures Chapter 1 he oundation: Logic 1 Lecture Overview 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Quantifiers l l l l l Statement Logical Connectives Conjunction

More information

LOGIC CONNECTIVES. Students who have an ACT score of at least 30 OR a GPA of at least 3.5 can receive a college scholarship.

LOGIC CONNECTIVES. Students who have an ACT score of at least 30 OR a GPA of at least 3.5 can receive a college scholarship. LOGIC In mathematical and everyday English language, we frequently use logic to express our thoughts verbally and in writing. We also use logic in numerous other areas such as computer coding, probability,

More information

A. Propositional Logic

A. Propositional Logic CmSc 175 Discrete Mathematics A. Propositional Logic 1. Statements (Propositions ): Statements are sentences that claim certain things. Can be either true or false, but not both. Propositional logic deals

More information

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook) Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or

More information

HANDOUT AND SET THEORY. Ariyadi Wijaya

HANDOUT AND SET THEORY. Ariyadi Wijaya HANDOUT LOGIC AND SET THEORY Ariyadi Wijaya Mathematics Education Department Faculty of Mathematics and Natural Science Yogyakarta State University 2009 1 Mathematics Education Department Faculty of Mathematics

More information

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional) Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.6) TOPICS Propositional Logic Logical Operators Truth Tables Implication Logical Equivalence Inference Rules What you should know about propositional

More information

software design & management Gachon University Chulyun Kim

software design & management Gachon University Chulyun Kim Gachon University Chulyun Kim 2 Outline Propositional Logic Propositional Equivalences Predicates and Quantifiers Nested Quantifiers Rules of Inference Introduction to Proofs 3 1.1 Propositional Logic

More information

The Logic of Compound Statements cont.

The Logic of Compound Statements cont. The Logic of Compound Statements cont. CSE 215, Computer Science 1, Fall 2011 Stony Brook University http://www.cs.stonybrook.edu/~cse215 Refresh from last time: Logical Equivalences Commutativity of :

More information

Unit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics

Unit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics Unit I LOGIC AND PROOFS B. Thilaka Applied Mathematics UNIT I LOGIC AND PROOFS Propositional Logic Propositional equivalences Predicates and Quantifiers Nested Quantifiers Rules of inference Introduction

More information

Why Learning Logic? Logic. Propositional Logic. Compound Propositions

Why Learning Logic? Logic. Propositional Logic. Compound Propositions Logic Objectives Propositions and compound propositions Negation, conjunction, disjunction, and exclusive or Implication and biconditional Logic equivalence and satisfiability Application of propositional

More information

Logic and Propositional Calculus

Logic and Propositional Calculus CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know

More information

Introduction to Sets and Logic (MATH 1190)

Introduction to Sets and Logic (MATH 1190) Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition

More information

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical

More information

Propositional Logic. Fall () Propositional Logic Fall / 30

Propositional Logic. Fall () Propositional Logic Fall / 30 Propositional Logic Fall 2013 () Propositional Logic Fall 2013 1 / 30 1 Introduction Learning Outcomes for this Presentation 2 Definitions Statements Logical connectives Interpretations, contexts,... Logically

More information

What is Logic? Introduction to Logic. Simple Statements. Which one is statement?

What is Logic? Introduction to Logic. Simple Statements. Which one is statement? What is Logic? Introduction to Logic Peter Lo Logic is the study of reasoning It is specifically concerned with whether reasoning is correct Logic is also known as Propositional Calculus CS218 Peter Lo

More information

THE LOGIC OF COMPOUND STATEMENTS

THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS All dogs have four legs. All tables have four legs. Therefore, all dogs are tables LOGIC Logic is a science of the necessary laws of thought, without which no employment

More information

Logic and Proofs. (A brief summary)

Logic and Proofs. (A brief summary) Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations

More information

Packet #1: Logic & Proofs. Applied Discrete Mathematics

Packet #1: Logic & Proofs. Applied Discrete Mathematics Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should

More information

Math 3336: Discrete Mathematics Practice Problems for Exam I

Math 3336: Discrete Mathematics Practice Problems for Exam I Math 3336: Discrete Mathematics Practice Problems for Exam I The upcoming exam on Tuesday, February 26, will cover the material in Chapter 1 and Chapter 2*. You will be provided with a sheet containing

More information

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus

More information

Mat 243 Exam 1 Review

Mat 243 Exam 1 Review OBJECTIVES (Review problems: on next page) 1.1 Distinguish between propositions and non-propositions. Know the truth tables (i.e., the definitions) of the logical operators,,,, and Write truth tables for

More information

n Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B

n Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.7, 5.5) TOPICS Sets and Functions Propositional and Predicate Logic Logical Operators and Truth Tables Logical Equivalences and Inference

More information

Discrete Structures & Algorithms. Propositional Logic EECE 320 // UBC

Discrete Structures & Algorithms. Propositional Logic EECE 320 // UBC Discrete Structures & Algorithms Propositional Logic EECE 320 // UBC 1 Review of last lecture Pancake sorting A problem with many applications Bracketing (bounding a function) Proving bounds for pancake

More information

1.1 Statements and Compound Statements

1.1 Statements and Compound Statements Chapter 1 Propositional Logic 1.1 Statements and Compound Statements A statement or proposition is an assertion which is either true or false, though you may not know which. That is, a statement is something

More information

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called

More information

2.2: Logical Equivalence: The Laws of Logic

2.2: Logical Equivalence: The Laws of Logic Example (2.7) For primitive statement p and q, construct a truth table for each of the following compound statements. a) p q b) p q Here we see that the corresponding truth tables for two statement p q

More information

Intro to Logic and Proofs

Intro to Logic and Proofs Intro to Logic and Proofs Propositions A proposition is a declarative sentence (that is, a sentence that declares a fact) that is either true or false, but not both. Examples: It is raining today. Washington

More information

Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.

Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another. Math 0413 Appendix A.0 Logic Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another. This type of logic is called propositional.

More information

Review. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions

Review. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions Review Propositions, propositional operators, truth tables Logical Equivalences. Tautologies & contradictions Some common logical equivalences Predicates & quantifiers Some logical equivalences involving

More information

The statement calculus and logic

The statement calculus and logic Chapter 2 Contrariwise, continued Tweedledee, if it was so, it might be; and if it were so, it would be; but as it isn t, it ain t. That s logic. Lewis Carroll You will have encountered several languages

More information

Propositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013

Propositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013 Propositional Logic Argument Forms Ioan Despi despi@turing.une.edu.au University of New England July 19, 2013 Outline Ioan Despi Discrete Mathematics 2 of 1 Order of Precedence Ioan Despi Discrete Mathematics

More information

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP) Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning Terminology, Notations, Definitions, & Principles: Mathematical Proof and Proving (MPP) 1. A statement

More information

Today s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)

Today s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference) Today s Lecture 2/25/10 Truth Tables Continued Introduction to Proofs (the implicational rules of inference) Announcements Homework: -- Ex 7.3 pg. 320 Part B (2-20 Even). --Read chapter 8.1 pgs. 345-361.

More information

ECOM Discrete Mathematics

ECOM Discrete Mathematics ECOM 2311- Discrete Mathematics Chapter # 1 : The Foundations: Logic and Proofs Fall, 2013/2014 ECOM 2311- Discrete Mathematics - Ch.1 Dr. Musbah Shaat 1 / 85 Outline 1 Propositional Logic 2 Propositional

More information

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov Introduction Logic Inference Discrete Mathematics Andrei Bulatov Discrete Mathematics - Logic Inference 6-2 Previous Lecture Laws of logic Expressions for implication, biconditional, exclusive or Valid

More information

Topics in Logic and Proofs

Topics in Logic and Proofs Chapter 2 Topics in Logic and Proofs Some mathematical statements carry a logical value of being true or false, while some do not. For example, the statement 4 + 5 = 9 is true, whereas the statement 2

More information

Logic and Propositional Calculus

Logic and Propositional Calculus CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know

More information

Compound Propositions

Compound Propositions Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth

More information

Introduction to Decision Sciences Lecture 2

Introduction to Decision Sciences Lecture 2 Introduction to Decision Sciences Lecture 2 Andrew Nobel August 24, 2017 Compound Proposition A compound proposition is a combination of propositions using the basic operations. For example (p q) ( p)

More information

1.1 Language and Logic

1.1 Language and Logic c Oksana Shatalov, Fall 2017 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,

More information

1 The Foundation: Logic and Proofs

1 The Foundation: Logic and Proofs 1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( 명제 ) a declarative sentence that is either true or false, but not both nor neither letters denoting propositions p, q, r, s, T:

More information

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference CSI 2350, Discrete Structures Chapter 1, Logic and Proofs (3) Young-Rae Cho Associate Professor Department of Computer Science Baylor University 1.6. Rules of Inference Basic Terminology Axiom: a statement

More information

Section 1.1: Logical Form and Logical Equivalence

Section 1.1: Logical Form and Logical Equivalence Section 1.1: Logical Form and Logical Equivalence An argument is a sequence of statements aimed at demonstrating the truth of an assertion. The assertion at the end of an argument is called the conclusion,

More information

A Quick Lesson on Negation

A Quick Lesson on Negation A Quick Lesson on Negation Several of the argument forms we have looked at (modus tollens and disjunctive syllogism, for valid forms; denying the antecedent for invalid) involve a type of statement which

More information

MAT2345 Discrete Math

MAT2345 Discrete Math Fall 2013 General Syllabus Schedule (note exam dates) Homework, Worksheets, Quizzes, and possibly Programs & Reports Academic Integrity Do Your Own Work Course Web Site: www.eiu.edu/~mathcs Course Overview

More information

2/13/2012. Logic: Truth Tables. CS160 Rosen Chapter 1. Logic?

2/13/2012. Logic: Truth Tables. CS160 Rosen Chapter 1. Logic? Logic: Truth Tables CS160 Rosen Chapter 1 Logic? 1 What is logic? Logic is a truth-preserving system of inference Truth-preserving: If the initial statements are true, the inferred statements will be true

More information

Chapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.

Chapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1. Chapter 1 Chapter Summary Propositional Logic The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.3) Predicate Logic The Language of Quantifiers (1.4) Logical Equivalences (1.4)

More information

1 The Foundation: Logic and Proofs

1 The Foundation: Logic and Proofs 1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( ) a declarative sentence that is either true or false, but not both nor neither letters denoting propostions p, q, r, s, T: true

More information

A Little Deductive Logic

A Little Deductive Logic A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that

More information

ICS141: Discrete Mathematics for Computer Science I

ICS141: Discrete Mathematics for Computer Science I ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Originals slides by Dr. Baek and Dr. Still, adapted by J. Stelovsky Based on slides Dr. M. P. Frank and Dr. J.L. Gross

More information

Section 1.1 Propositions

Section 1.1 Propositions Set Theory & Logic Section 1.1 Propositions Fall, 2009 Section 1.1 Propositions In Chapter 1, our main goals are to prove sentences about numbers, equations or functions and to write the proofs. Definition.

More information

Proposition logic and argument. CISC2100, Spring 2017 X.Zhang

Proposition logic and argument. CISC2100, Spring 2017 X.Zhang Proposition logic and argument CISC2100, Spring 2017 X.Zhang 1 Where are my glasses? I know the following statements are true. 1. If I was reading the newspaper in the kitchen, then my glasses are on the

More information

Where are my glasses?

Where are my glasses? Proposition logic and argument CISC2100, Spring 2017 X.Zhang 1 Where are my glasses? I know the following statements are true. 1. If I was reading the newspaper in the kitchen, then my glasses are on the

More information

Manual of Logical Style (fresh version 2018)

Manual of Logical Style (fresh version 2018) Manual of Logical Style (fresh version 2018) Randall Holmes 9/5/2018 1 Introduction This is a fresh version of a document I have been working on with my classes at various levels for years. The idea that

More information

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

COMP219: Artificial Intelligence. Lecture 19: Logic for KR COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof

More information

3 The Semantics of the Propositional Calculus

3 The Semantics of the Propositional Calculus 3 The Semantics of the Propositional Calculus 1. Interpretations Formulas of the propositional calculus express statement forms. In chapter two, we gave informal descriptions of the meanings of the logical

More information

Manual of Logical Style

Manual of Logical Style Manual of Logical Style Dr. Holmes January 9, 2015 Contents 1 Introduction 2 2 Conjunction 3 2.1 Proving a conjunction...................... 3 2.2 Using a conjunction........................ 3 3 Implication

More information

Rules Build Arguments Rules Building Arguments

Rules Build Arguments Rules Building Arguments Section 1.6 1 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments Rules of Inference for Quantified Statements Building Arguments for Quantified

More information

Logic and Proof. Aiichiro Nakano

Logic and Proof. Aiichiro Nakano Logic and Proof Aiichiro Nakano Collaboratory for Advanced Computing & Simulations Department of Computer Science Department of Physics & Astronomy Department of Chemical Engineering & Materials Science

More information

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction. Statements Compounds and Truth Tables. Statements, Negations, Compounds, Conjunctions, Disjunctions, Truth Tables, Logical Equivalence, De Morgan s Law, Tautology, Contradictions, Proofs with Logical Equivalent

More information

Logic. Logic is a discipline that studies the principles and methods used in correct reasoning. It includes:

Logic. Logic is a discipline that studies the principles and methods used in correct reasoning. It includes: Logic Logic is a discipline that studies the principles and methods used in correct reasoning It includes: A formal language for expressing statements. An inference mechanism (a collection of rules) to

More information

Propositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38

Propositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38 Propositional Logic Jason Filippou CMSC250 @ UMCP 05-31-2016 ason Filippou (CMSC250 @ UMCP) Propositional Logic 05-31-2016 1 / 38 Outline 1 Syntax 2 Semantics Truth Tables Simplifying expressions 3 Inference

More information

A Little Deductive Logic

A Little Deductive Logic A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that

More information

COMP 2600: Formal Methods for Software Engineeing

COMP 2600: Formal Methods for Software Engineeing COMP 2600: Formal Methods for Software Engineeing Dirk Pattinson Semester 2, 2013 What do we mean by FORMAL? Oxford Dictionary in accordance with convention or etiquette or denoting a style of writing

More information

Discrete Mathematics

Discrete Mathematics Discrete Mathematics Discrete mathematics is devoted to the study of discrete or distinct unconnected objects. Classical mathematics deals with functions on real numbers. Real numbers form a continuous

More information

Review of Predicate Logic

Review of Predicate Logic Review of Predicate Logic Martin Held FB Computerwissenschaften Universität Salzburg A-5020 Salzburg, Austria held@cosy.sbg.ac.at 19. Jänner 2016 COMPUTERWISSENSCHAFTEN Legal Fine Print and Disclaimer

More information

Discrete Structures of Computer Science Propositional Logic I

Discrete Structures of Computer Science Propositional Logic I Discrete Structures of Computer Science Propositional Logic I Gazihan Alankuş (Based on original slides by Brahim Hnich) July 26, 2012 1 Use of Logic 2 Statements 3 Logic Connectives 4 Truth Tables Use

More information

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional Logical Operators Conjunction Disjunction Negation Exclusive Or Implication Biconditional 1 Statement meaning p q p implies q if p, then q if p, q when p, q whenever p, q q if p q when p q whenever p p

More information

1.1 Language and Logic

1.1 Language and Logic c Oksana Shatalov, Spring 2018 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,

More information

Introduction to Metalogic

Introduction to Metalogic Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)

More information

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the

More information

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) (2011 Admission Onwards) I Semester Core Course FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK 1) If A and B are two sets

More information

Logic and Proofs. (A brief summary)

Logic and Proofs. (A brief summary) Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations

More information

Section 1.3. Let I be a set. When I is used in the following context,

Section 1.3. Let I be a set. When I is used in the following context, Section 1.3. Let I be a set. When I is used in the following context, {B i } i I, we call I the index set. The set {B i } i I is the family of sets of the form B i where i I. One could also use set builder

More information

EECS 1028 M: Discrete Mathematics for Engineers

EECS 1028 M: Discrete Mathematics for Engineers EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 12 Using the laws

More information

Advanced Topics in LP and FP

Advanced Topics in LP and FP Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection

More information

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Discrete Mathematics Solution Guide Marcel B. Finan c All Rights Reserved 2015 Edition Contents

More information

Introducing Proof 1. hsn.uk.net. Contents

Introducing Proof 1. hsn.uk.net. Contents Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction

More information

III. Elementary Logic

III. Elementary Logic III. Elementary Logic The Language of Mathematics While we use our natural language to transmit our mathematical ideas, the language has some undesirable features which are not acceptable in mathematics.

More information

Artificial Intelligence: Knowledge Representation and Reasoning Week 2 Assessment 1 - Answers

Artificial Intelligence: Knowledge Representation and Reasoning Week 2 Assessment 1 - Answers Artificial Intelligence: Knowledge Representation and Reasoning Week 2 Assessment 1 - Answers 1. When is an inference rule {a1, a2,.., an} c sound? (b) a. When ((a1 a2 an) c) is a tautology b. When ((a1

More information

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1) Week 1: Logic Lecture 1, 8/1 (Sections 1.1 and 1.3) Examples of theorems and proofs Theorem (Pythagoras). Let ABC be a right triangle, with legs of lengths a and b, and hypotenuse of length c. Then a +

More information

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows. Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is

More information

Section 3.1 Statements, Negations, and Quantified Statements

Section 3.1 Statements, Negations, and Quantified Statements Section 3.1 Statements, Negations, and Quantified Statements Objectives 1. Identify English sentences that are statements. 2. Express statements using symbols. 3. Form the negation of a statement 4. Express

More information

PSU MATH RELAYS LOGIC & SET THEORY 2017

PSU MATH RELAYS LOGIC & SET THEORY 2017 PSU MATH RELAYS LOGIC & SET THEORY 2017 MULTIPLE CHOICE. There are 40 questions. Select the letter of the most appropriate answer and SHADE in the corresponding region of the answer sheet. If the correct

More information