DISCRETE MATHEMATICS BA202
|
|
- Erin Campbell
- 6 years ago
- Views:
Transcription
1 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 LOGIC Propositions A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both. Example 1: All the following declarative sentences are propositions. i. Kuala Lumpur is the capital of Malaysia. (True) ii. Perak is the biggest state in Malaysia. (False) iii = 2 (True) iv = 3 (False) Example 2: All the following not declarative sentences are not propositions. i. What time is it? ii. Read this carefully. iii. x + 1 = 2 iv. x + y = z Letter (p, q, r, s, ) are used to denote the propositional variable. True propositional truth value is True and denoted by T. False propositional truth value is False and denoted by F. Compound Propositions The combination of one or more propositions. Are formed from existing propositions using logical operators. The types of compound propositions:- I. Negation II. Conjunction III. Disjunction inclusive or IV. Disjunction exclusive or V. Conditional statements - Converse - Contrapositive - Inverse VI. Biconditional statements Negation Let p be a proposition. The negation of p, denoted by p (also denoted by ), read as not p, is the statement It is not the case that p. Example 3: Prepared By Chiang Yoke Yen(2012) Page 1
2 Proposition (p) Negation of proposition ( p) Today is Friday Today is not Friday = < 2 TABLE 1: The Truth Table for the negation of a proposition:- p p T F F T Conjunction Let p and q be a proposition. The conjunction of p and q, denoted by p q, is the proposition p and q. The conjunction p q is true when both p and q are true and is false otherwise. Example 4: p : It is raining. q : It is cold. The proposition It is raining and cold. (p q) is consider as TRUE when it is raining (p is True) and it is cold (q is True). Otherwise or other situation is FALSE. In Logic the word but sometimes is used instead of and in a conjunction. For example, the statement The sun is shining, but it is raining. is another way of saying The sun is shining and it is raining. TABLE 2: The Truth Table for the conjunction of two propositions:- p q p q T T T T F F F T F F F F Disjunction inclusive or Let p and q be a proposition. The disjunction of p and q, denoted by p q, is the proposition p or q. The disjunction p q is false when both p and q are false and is true otherwise. Example 5: p : It is raining. q : It is cold. The proposition It is raining and cold. (p q) is consider as FALSE when it is not raining (p is False) and it is not cold (q is False). Otherwise or other situation is TRUE. TABLE 3: The Truth Table for the disjunction of two propositions:- p q p q T T T T F T F T T F F F Prepared By Chiang Yoke Yen(2012) Page 2
3 Disjunction exclusive or Let p and q be a proposition. The exclusive or of p and q, denoted by p q, is the proposition that is true when exactly one of p and q is true and is false otherwise. TABLE 4: The Truth Table for the Exclusive Or of two propositions:- p q p q T T F T F T F T T F F F Conditional statements Let p and q be a proposition. The conditional statement (or implication) p q is the proposition if p, then q. The conditional statement p q is false when p is true and q is false and true otherwise. In the conditional statement p q, p is called the hypothesis (or antecedent or premise) and q is called the conclusion (or consequence). The following common ways to express the conditional statement p q: if p, then q p implies q if p, q p only if q p is sufficient for q a sufficient condition for q is p q if p q whenever p q when p q is necessary for p a necessary condition for p is q q follows from p q unless p Example 6: p : Maria learns Discrete Mathematics. q : Maria will find a good job.. There are many ways to represent this conditional statement in English: If Maria learns Discrete Mathematics, then she will find a good job. Maria will find a good job when she learns Discrete Mathematics. A sufficient condition for Maria to find a good job is learns Discrete Mathematics. Maria will find a good job unless she does not learn Discrete Mathematics. The conditional statement If Maria learns Discrete Mathematics, then she will find a good job. (p q) is consider as FALSE when Maria learns Discrete Mathematics (p is True) but she does not get a good job (q is False). Otherwise or other situation is TRUE. TABLE 5: The Truth Table for the conditional statement p q: p q p q T T T T F F F T T F F T q p is called the converse of p q. q p is called the contrapositive of p q. p q is called the inverse of p q. Prepared By Chiang Yoke Yen(2012) Page 3
4 Example 7: What are the converse, the contrapositive and the inverse of the conditional statement The home team wins whenever it is raining.? Because q whenever p is one of the ways to express the conditional statement, thus p : It is raining. q : The home team wins. The converse is If the home team wins, then it is raining. The contrapositive is If the home team does not win, then it is not raining. The inverse is If it is not raining, then the home team does not win. Only the contrapositive is equivalent to the original statement. Biconditional Statements Let p and q be propositions. The biconditional statement (or bi-implications) p q is the proposition p if and only if q. The biconditional statement p q is true when p and q have the same truth values, and is false otherwise. There are some other common ways to express p q: p is necessary and sufficient for q if p then q, and conversely p iff q p q has exactly the same truth value as (p q) (q p). Example 8: p : You can take the flight. q : You buy a ticket. The statement You can take the flight if and only if you buy a ticket (p q) is consider as TRUE if p and q are either both true or both false, that is - If you buy a ticket (q is True) and you can take a flight (p is True). - If you do not buy a ticket (q is False) and you cannot take the flight (p is False). The statement You can take the flight if and only if you buy a ticket (p q) is consider as FALSE if p and q have opposite truth values, that is - When you do not buy a ticket (q is False) but you can take the flight (p is True). - When you buy a ticket (q is True) but you cannot take the flight (p is False). TABLE 6: The Truth Table for the biconditional statement p q: p q p q T T T T F F F T F F F T Prepared By Chiang Yoke Yen(2012) Page 4
5 Truth Tables of Compound Propositions We can construct a truth table of the compound proposition by using the precedence of logical operator: Operator Precedence Example 9: Construct the truth table of the compound proposition (p q) (p q). p q q p q p q (p q) (p q) T T F T T T T F T T F F F T F F F T F F T T F F Example 10: Construct the truth table of the compound proposition (p q) ( r). p q r p q (p q) r (p q) ( r) T T T T F F F T T F T F T T T F T F T F T T F F F T T T F T T F T F T F T F F T T T F F T F T F T F F F F T T T Propositional Equivalences A tautology is the compound proposition that is always true. A contradiction is the compound proposition that is always false. A contingent statement is one that is neither a tautology nor a contradiction. Example 11: Show that p q q p is tautology. p q p q p q q p p q q p T T F F T T T T F F T F F T F T T F T T T F F T T T T T Because all the truth values are True, thus p q q p is tautology. Prepared By Chiang Yoke Yen(2012) Page 5
6 TUTORIAL EXERCISE Which of these sentences are propositions? What are the truth values of those that are proposition? a) Malaysia is the biggest century in Asia. b) = 5. c) Do not pass go. d) < 10 e) 4 + x = 5. f) Polytechnic Ungku Omar is the Polytechnic Premier. 2. What is the negation of each of these propositions? a) I will go to find you later. b) There is no population in New York. c) = 3. d) The summer in Taipei is hot and sunny. 3. Let p and q be the propositions p : Mei has saving ten thousand dollar in bank. q : Mei will has a trip to Hawaii. Express each of these propositions as English sentence. a) p b) p q c) p q d) p q e) p q f) p (p q) 4. Let p and q be the propositions p : It is a sunny day. q : We will go to the beach Write these propositions using p and q and logically connectives. a) It is a sunny day and we will go to the beach. b) It is a sunny day but we do not go to the beach. c) It is not a sunny day or we go to the beach. d) We will go to the beach when it is a sunny day. e) It is a sunny day if and only if we will go to the beach. 5. Determine whether each of these statements is true or false. a) = 3 if and only if monkey can fly. b) 0 > 1 if and only if 2 > 1. c) = 4 if and only if = 2. d) If = 2, then 1 is a integer number. e) If monkey can fly, then = 2. f) If = 2, then monkey can fly. g) If 8 5 = 2, then = 8. Prepared By Chiang Yoke Yen(2012) Page 6
7 6. Write each of these propositions in the form if p, then q in English. a) It is necessary to wash the boss s car to get promoted. b) John gets caught whenever he cheats. c) Mary will go swimming unless the water is too cold. d) I will remember to send you the address only if you send me an message. 7. Write each of these propositions in the form p if and only if q in English. a) If you read the newspaper every day, you will be informed, and conversely. b) The trains run late on exactly those days when I take it. c) If it is hot outside you drink an ice tea, and if you drink an ice tea it is hot outside. d) For you to win the contest it is necessary and sufficient that you have the only winning ticket. 8. State the converse, contrapositive, and inverse of each of these conditional statements. a) If it raining tonight, then I will stay at home. b) I come to class whenever there is going to be a quiz. 9. Construct a truth table for each of these compound propositions and determine whether these compound propositions are a tautology. a) (p q) ( q p) b) (p q) (p q) c) (p q) ( p r) d) (p q) p e) [(p q) (q r)] (p r) Prepared By Chiang Yoke Yen(2012) Page 7
8 1.2 RULES OF INFERENCE Valid Arguments in Propositional Logic An argument is a sequence of propositions which contains premises and a conclusion. P 1 P 2 Premises (Hypotheses) P 3... Conclusion Consider the following argument involving propositions: If you have the password, then you can log onto the network. You have the password. Therefore, You can log onto the network. The argument has the form p q p We would like to determine whether this is a valid argument. An argument is valid when all its premises are true implies that the conclusion is true. We can always use a truth table to show that an argument form is valid. Example 12: Is the argument above is valid? Premises Conclusion p q p q p q T T T T T T F F T F F T T F T F F T F F Thus, that argument is valid. Example 13: So, is this argument a valid argument? p q q Premises Conclusion p q p q q p T T T T T T F F F T F T T T F F F T F F This is not a valid argument because the premises are true but the conclusion is false. Another way, the argument form with premises P 1, P 2,, P n and conclusion q is valid when (P 1 P 2 P n ) q is a tautology. Prepared By Chiang Yoke Yen(2012) Page 8
9 Example 14: show that the argument below is valid with using tautology. p (q r) r The argument is valid when (p (q r)) ( r) (p q) is a tautology. p q r q r p (q r) r (p (q r)) ( r) p q (p (q r)) ( r) (p q) T T T T T F F T T T T F T T T T T T T F T T T F F T T T F F F T T T T T F T T T T F F T T F T F T T T T T T F F T T T F F F T F F F F F T F F T It is a tautology. Therefore, the argument is valid. Rules of Inference for Propositional Logic Rules of inference are the validity of some relatively simple argument forms which do not have to resort to truth table. Table of the rules of inference: Rules of Tautology Name Example 15 Inference p q p p q q p q q r p r p q p q p p q [(p q) p] q [(p q) q] p [(p q) (q r)] (p r) [(p q) p] q Modus Ponens Modus Tollens Hypothetical Syllogism Disjunctive Syllogism If it is a raining day, then I will stay at home. It is a raining day. Therefore, I will stay at home. If it is a raining day, then I will stay at home. I will not stay at home. Thus, it is not a raining day. If it is a raining day, then I will stay at home. If I stay at home, then I will cook dinner for you. Therefore, if it is a raining day, then I will cook dinner for you. It is either a raining day or I will stay at home. It is not a raining day. Therefore, I will stay at home. p (p q) Addition It is a raining day. Therefore, it is either a raining day or I will stay at home. Let p : It is a raining day. q : I will stay at home. r : I will cook dinner for you. Prepared By Chiang Yoke Yen(2012) Page 9
10 Using Rules of Inference to Build Valid Argument When there are many premises, several rules of inference are often needed to show that an argument is valid. There are two steps to build valid argument by using rules of inference:- First step: - List out all the premises and the conclusion which denoted by letter such as p, q, r, s, t, and so on and build the valid argument Second step: - Show that the hypotheses lead to conclusion by using the rules of inference and state what kind of rules are using. Example 16: Show that the hypothesis If you send me an message, then I will finish writing the report, If you do not send me an message, then I will go to sleep early, and If I go to sleep early, then I will wake up early lead to the conclusion If I do not finish writing the report, then I will wake up early. Step 1: Let p : You send me an message. q : I will finish writing the report. r : I will go to sleep early. s : I will wake up early. So, the premises are p q, p r, r s and the conclusion is q s. The argument form is p q p r r s q s Step 2: Steps Reasons 1) p q Hypothesis / Premise 2) q p Use step (1) and Contrapositive 3) p r Hypothesis / Premise 4) q r Use step (2), (3), and Hypothetical Syllogism 5) r s Hypothesis / Premise 6) q s Use step (4), (5), and Hypothetical Syllogism This argument form shows that the hypotheses lead to the desired conclusion. TUTORIAL EXERCISE 1.2 Prepared By Chiang Yoke Yen(2012) Page 10
11 1. What rules of inference is used in each of these arguments? a) Linda is a Mathematics major. Therefore, Linda is either a Mathematics major or a Information Technology major. b) John is either likes reading or drawing. John dislikes reading. Therefore, John likes drawing. c) If tomorrow is a sunny day, then we will go swimming. Tomorrow is a sunny day. Therefore, we will go swimming. d) If I go swimming, then I will not go shopping. If I do not go shopping, then you help me buy the New Times magazine. Therefore, if I go swimming, then you help me buy the New Times magazine. e) If I finish the report today, then I will send the report for you tomorrow. I do not send the report for you tomorrow. Therefore I do not finish the report today. 2. Explain the rules of inference used to show that the hypotheses lead to the desired conclusion. a) Cindy works hard. If Cindy works hard, then she is a hardworking girl. If Cindy is a hardworking girl, then she will get the job. Therefore, Cindy will get the job. b) I am either lucky or clever. I am not lucky. If I am clever, then I will get a good result in SPM. I will get a good result in SPM. c) If Mary has free times, then she will go shopping. Mary buys a new skirt if she goes shopping. Mary does not buy a new skirt. Therefore, Mary does not have free times. 1.3 PREDICATE LOGIC Prepared By Chiang Yoke Yen(2012) Page 11
12 The proposition logic is not powerful enough to represent all types of assertions that are used in computer science and mathematics. Predicate logic is a more powerful type of logic to express the meaning of a wide range of statements in mathematics and computer science in ways to reason and explore relationships between objects. Predicate Logic Statement involving variables, such as:- x > 3 x = y +3 x + y = z computer x is functioning properly. are often found in mathematical assertions, in computer programs, and in system specifications. These statements are neither true nor false when the values of the variables are not specified. The statement x is greater than 3 has two part:- First part the variable x, is the subject of the statement. Second part the predicate, is greater than 3 The statement x is greater than 3 denote by P(x), where P denotes the predicate is greater than 3 and x is the variable. Example 17: Let P(x) denote the statement x > 3. What are the truth values of P(4) and P(2)? For P(4), the x = 4, thus the truth value is T since 4 > 3 is a true statement. For P(2), the x = 2, thus the truth value is F since 2 > 3 is a false statement. Example 18: Let Q(x, y) denote the statement x = y +3. What are truth values of the propositions Q(1, 2) and Q(3, 0)? For Q(1, 2), set x = 1 and y = 2 in the statement Q(x, y). Hence the truth value is F since 1 = is a false statement. For Q(3, 0), set x = 3 and y = 0 in the statement Q(x, y). Hence the truth value is T since 3 = is a true statement. Quantifiers Quantification is another important way to create a proposition from a propositional function. Quantification expresses the extent to which a predicate is true over a range of elements. In English, the words all, some, many, none, and few are used in quantification. Two types of quantification:- a) Universal Quantifier (a predicate is true for every element under consideration.) b) Existential Quantifier (there is one or more element under consideration for which predicate is true.) Universal Quantifier Prepared By Chiang Yoke Yen(2012) Page 12
13 The universal quantifier of P(x) is the statement P(x) for all values of x in the domain, denoted by, which read as for all x P(x) or for every x P(x) and called the universal quantifier. An element for which P(x) is false is called a counterexample of. is same as conjunction. Example 19: Let P(x) be the statement x + 1 > x. What is the truth value of the quantification, where the domain consists of all real numbers? The quantification is true since P(x) is true for all real numbers x. Example 20: Let Q(x) be the statement x < 2.What is the truth value of the quantification, where the domain consists of all real numbers? Q(x) is not true for every real number x, because, for instance Q(3) is false. That is, x = 3 is a counterexample for the statement. Thus is false. Existential Quantifier The existential quantifier of P(x) is the proposition There exist an element x in the domain such that P(x), denoted by, which read as there is an x such that P(x), there is at least one x such that P(x) or for some x P(x). quantifier. is false if and only if P(x) is false for every element of the P(x). is same as disjunction. is called the existential Example 21: Let P(x) denote the statement x > 3. What is the truth value of the quantification, where the domain consists of all real numbers? Because x > 3 is sometimes true for instance, when x = 4, thus is true. Let Q(x) denote the statement x = x + 1. What is the truth value of the quantification, where the domain consists of all real numbers? Because Q(x) is false for every real number x, the existential quantifier of Q(x), which is, is false. The truth value of and summarized as: is true when there is all x for P(x) is true and it is false when P(x) is false for either x. is true when there is an x for which P(x) is true and it is false when P(x) is false for every x. Translating English Sentences into Logical Expressions Translating English into logical expression becomes more complex when quantifiers are needed. There can be many ways to translate a particular sentence. Example 22: Express the statement Every student in this class has studied calculus using predicates and quantifiers. Prepared By Chiang Yoke Yen(2012) Page 13
14 First step: Rewrite the statement so that can identify the appropriate quantifiers to use. For every student in this class, that student has studied calculus. Second step: Introduce a variable x so that the statement becomes For every student x in this class, x has studied calculus. Third step: Introduce C(x), which is the statement x has studied calculus. If the domain for x consists of the students in the class, then the statement translate as. Example 23: Express the statements Some student in this class has visited Malacca using predicates and quantifiers. First step: Rewrite the statement so that can identify the appropriate quantifiers to use. There is a student in this class, that the student has visited Malacca. Second step: Introduce a variable x so that the statement becomes There is a student in x this class, that x has visited Malacca. Third step: Introduce M(x), which is the statement x has visited Malacca. If the domain for x consists of the students in the class, then the statement translate as. Example 24: Let C(x, y) be the predicate x clever than y and let the universe of discourse be the set of all students. Use quantifiers to express the statement Not everyone is not clever than someone. First step: Rewrite the statement so that can identify the appropriate quantifiers to use. Not every students is not clever than some students. Second step: Introduce a variable x so that the statement becomes Not every x is not clever than some y. Third step: Hence, the statement translate as. Example 25: Let P(x, y) be the predicate x loves y and let the universe of discourse be the set of all people in Malaysia. Express the quantification in sentences. express to someone in Malaysia. express to everyone in Malaysia. Because P(x, y) is the predicate x loves y, thus express to x not love y Combine all the sentences and will become Someone in Malaysia not love everyone in Malaysia. Tutorial Exercise 1.3 Prepared By Chiang Yoke Yen(2012) Page 14
15 1. Let P(x) be the statement the word x contains the letter a. What are the truth values? a) P(Discrete) b) P(Mathematics) c) P(True) d) P(False) 2. Let Q(x, y) denote the statement x 2 > y. What are the truth values? a) Q(1, 2) b) Q(-3, 8) c) Q(, 3) 3. Let P(x) be the statement x likes subject mathematics, where the domain for x consists of all students. Express each of these quantifications in English. a) b) c) d) 4. Let Q(x) denote the statement x + 1 = 2x. If the universe of discourse is all integers, what are these truth values? a) Q(0) b) Q(-1) c) Q(1) d) e) f) g) 5. Let C(x, y) be the statement x is a friend of y, where the domain for x and y consists of all people. Use quantifications to express each of the following statements. a) Everyone is a friend of everyone. b) Not everyone is a friend of someone. c) Someone is not a friend of someone. d) There is a friend of John. e) Mary is not a friend of everyone. 6. Let P(x, y) be the statement x dislike y, where the domain for x is all students and the domain for y consists of all subjects. Express each of these quantifications in English. a) x y P(x, y) b) x y P(x, y) c) x y P(x, y) d) x P(x, Mathematics) Prepared By Chiang Yoke Yen(2012) Page 15
16 e) y P(Maria, y) 7. Let H(x) be the statement x is hardworking, N(x) be the statement x is naughty and C(x) be the statement x is clever, where the domain for x consists of all students. Use quantifications to express each of the following statements. a) Some students are clever but naughty. b) Not all students are clever and hardworking. c) Some students are clever, hardworking and not naughty. d) All students are clever, or hardworking or naughty. Prepared By Chiang Yoke Yen(2012) Page 16
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 informationECOM 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 informationCS100: 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 informationCHAPTER 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 informationsoftware 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 informationPROPOSITIONAL 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 informationDiscrete 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 information3/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 informationn 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 informationChapter 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 informationIntro 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 informationLogic 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 informationWhat 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 informationWhy 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 informationThe 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 informationCSC 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 information10/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 informationMethods of Proof. 1.6 Rules of Inference. Argument and inference 12/8/2015. CSE2023 Discrete Computational Structures
Methods of Proof CSE0 Discrete Computational Structures Lecture 4 When is a mathematical argument correct? What methods can be used to construct mathematical arguments? Important in many computer science
More informationRules 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 informationPredicate Logic & Quantification
Predicate Logic & Quantification Things you should do Homework 1 due today at 3pm Via gradescope. Directions posted on the website. Group homework 1 posted, due Tuesday. Groups of 1-3. We suggest 3. In
More informationLogical 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 informationDiscrete 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 informationRules of Inference. Arguments and Validity
Arguments and Validity A formal argument in propositional logic is a sequence of propositions, starting with a premise or set of premises, and ending in a conclusion. We say that an argument is valid if
More informationIntroduction 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 informationReview: Potential stumbling blocks
Review: Potential stumbling blocks Whether the negation sign is on the inside or the outside of a quantified statement makes a big difference! Example: Let T(x) x is tall. Consider the following: x T(x)
More informationChapter 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 informationEECS 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 / 26 Why Study Logic?
More informationHW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall
CSE 20 HW1 graded review form? HW2 released DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Translate sentences from English to propositional logic using appropriate
More informationAn Introduction to Logic 1.1 ~ 1.4 6/21/04 ~ 6/23/04
An Introduction to Logic 1.1 ~ 1.4 6/21/04 ~ 6/23/04 1 A Taste of Logic Logic puzzles (1) Knights and Knaves Knights: always tell the truth Knaves: always lie You encounter two people A and B. A says:
More informationn 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 informationCS 2336 Discrete Mathematics
CS 2336 Discrete Mathematics Lecture 3 Logic: Rules of Inference 1 Outline Mathematical Argument Rules of Inference 2 Argument In mathematics, an argument is a sequence of propositions (called premises)
More informationDiscrete 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 information1 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 informationLogic 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 informationChapter 1, Part I: Propositional Logic. With Question/Answer Animations
Chapter 1, Part I: Propositional Logic With Question/Answer Animations Chapter Summary Propositional Logic The Language of Propositions Applications Logical Equivalences Predicate Logic The Language of
More information2. 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 information1 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 informationMAT2345 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 informationReadings: Conjecture. Theorem. Rosen Section 1.5
Readings: Conjecture Theorem Lemma Lemma Step 1 Step 2 Step 3 : Step n-1 Step n a rule of inference an axiom a rule of inference Rosen Section 1.5 Provide justification of the steps used to show that a
More informationKS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE. Discrete Math Team
KS091201 MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE Discrete Math Team 2 -- KS091201 MD W-04 Outline Valid Arguments Modus Ponens Modus Tollens Addition and Simplification More Rules
More informationMathacle. PSet ---- Algebra, Logic. Level Number Name: Date: I. BASICS OF PROPOSITIONAL LOGIC
I. BASICS OF PROPOSITIONAL LOGIC George Boole (1815-1864) developed logic as an abstract mathematical system consisting of propositions, operations (conjunction, disjunction, and negation), and rules for
More informationChapter 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 informationMat 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 informationCompound 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 informationChapter 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 informationPropositional Logic Not Enough
Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks
More informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #4: Predicates and Quantifiers Based on materials developed by Dr. Adam Lee Topics n Predicates n
More informationA. 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 information2/18/14. What is logic? Proposi0onal Logic. Logic? Propositional Logic, Truth Tables, and Predicate Logic (Rosen, Sections 1.1, 1.2, 1.
Logic? Propositional Logic, Truth Tables, and Predicate Logic (Rosen, Sections 1.1, 1.2, 1.3) TOPICS Propositional Logic Logical Operations Equivalences Predicate Logic CS160 - Spring Semester 2014 2 What
More information2/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 informationUnit 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 informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #6: Rules of Inference Based on materials developed by Dr. Adam Lee Today s topics n Rules of inference
More informationLogic. 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 informationLecture 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 informationCOMP 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 informationReview. 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 information3. The Logic of Quantified Statements Summary. Aaron Tan August 2017
3. The Logic of Quantified Statements Summary Aaron Tan 28 31 August 2017 1 3. The Logic of Quantified Statements 3.1 Predicates and Quantified Statements I Predicate; domain; truth set Universal quantifier,
More informationMATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG
MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG Suggested Problems for Logic and Proof The following problems are from Discrete Mathematics and Its Applications by Kenneth H. Rosen. 1. Which of these
More informationPropositional 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 informationAnnouncements CompSci 102 Discrete Math for Computer Science
Announcements CompSci 102 Discrete Math for Computer Science Read for next time Chap. 1.4-1.6 Recitation 1 is tomorrow Homework will be posted by Friday January 19, 2012 Today more logic Prof. Rodger Most
More informationLogic, 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 informationProofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.
Proofs A mathematical system consists of axioms, definitions and undefined terms. An axiom is assumed true. Definitions are used to create new concepts in terms of existing ones. Undefined terms are only
More informationTHE 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 informationLogic 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 informationSec$on Summary. Propositions Connectives. Truth Tables. Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional
Section 1.1 Sec$on Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional ruth ables 2 Proposi$ons A proposition is a declarative
More informationMath 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 information1.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 informationDiscrete Mathematics and Its Applications
Discrete Mathematics and Its Applications Lecture 1: The Foundations: Logic and Proofs (1.3-1.5) MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 19, 2017 Outline 1 Logical
More informationSection 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 informationProposition 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 informationWhere 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 informationSection Summary. Section 1.5 9/9/2014
Section 1.5 Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements into Statements involving Nested Quantifiers Translated
More informationSection Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier
Section 1.4 Section Summary Predicate logic Quantifiers Universal Quantifier Existential Quantifier Negating Quantifiers De Morgan s Laws for Quantifiers Translating English to Logic Propositional Logic
More informationDiscrete Mathematics. Sec
Islamic University of Gaza Faculty of Engineering Department of Computer Engineering Fall 2011 ECOM 2311: Discrete Mathematics Eng. Ahmed Abumarasa Discrete Mathematics Sec 1.1-1.6 The Foundations: Logic
More informationLogic. 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 informationConjunction: 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 informationMath.3336: Discrete Mathematics. Nested Quantifiers/Rules of Inference
Math.3336: Discrete Mathematics Nested Quantifiers/Rules of Inference Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu
More informationCSCI-2200 FOUNDATIONS OF COMPUTER SCIENCE
1 CSCI-2200 FOUNDATIONS OF COMPUTER SCIENCE Spring 2015 February 5, 2015 2 Announcements Homework 1 is due now. Homework 2 will be posted on the web site today. It is due Thursday, Feb. 12 at 10am in class.
More informationHANDOUT 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 informationLogic. Def. A Proposition is a statement that is either true or false.
Logic Logic 1 Def. A Proposition is a statement that is either true or false. Examples: Which of the following are propositions? Statement Proposition (yes or no) If yes, then determine if it is true or
More information1.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 informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs
More informationICS141: 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 informationWUCT121. 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 informationICS141: 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 informationSteinhardt 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 informationOverview. 1. Introduction to Propositional Logic. 2. Operations on Propositions. 3. Truth Tables. 4. Translating Sentences into Logical Expressions
Note 01 Propositional Logic 1 / 10-1 Overview 1. Introduction to Propositional Logic 2. Operations on Propositions 3. Truth Tables 4. Translating Sentences into Logical Expressions 5. Preview: Propositional
More informationSection Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier
Section 1.4 Section Summary Predicate logic Quantifiers Universal Quantifier Existential Quantifier Negating Quantifiers De Morgan s Laws for Quantifiers Translating English to Logic Propositional Logic
More informationTools for reasoning: Logic. Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications:
Tools for reasoning: Logic Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications: 1 Why study propositional logic? A formal mathematical language for precise
More informationLogic 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 informationPredicate Logic. Andreas Klappenecker
Predicate Logic Andreas Klappenecker Predicates A function P from a set D to the set Prop of propositions is called a predicate. The set D is called the domain of P. Example Let D=Z be the set of integers.
More informationComputer Science 280 Spring 2002 Homework 2 Solutions by Omar Nayeem
Computer Science 280 Spring 2002 Homework 2 Solutions by Omar Nayeem Part A 1. (a) Some dog does not have his day. (b) Some action has no equal and opposite reaction. (c) Some golfer will never be eated
More informationSolutions to Exercises (Sections )
s to Exercises (Sections 1.1-1.10) Section 1.1 Exercise 1.1.1: Identifying propositions (a) Have a nice day. : Command, not a proposition. (b) The soup is cold. : Proposition. Negation: The soup is not
More informationCS0441 Discrete Structures Recitation 3. Xiang Xiao
CS0441 Discrete Structures Recitation 3 Xiang Xiao Section 1.5 Q10 Let F(x, y) be the statement x can fool y, where the domain consists of all people in the world. Use quantifiers to express each of these
More informationIntroduction 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 informationSolutions to Exercises (Sections )
s to Exercises (Sections 1.11-1.12) Section 1.11 Exercise 1.11.1 (a) p q q r r p 1. q r Hypothesis 2. p q Hypothesis 3. p r Hypothetical syllogism, 1, 2 4. r Hypothesis 5. p Modus tollens, 3, 4. (b) p
More informationICS141: 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 informationA 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 informationOutline. Rules of Inferences Discrete Mathematics I MATH/COSC 1056E. Example: Existence of Superman. Outline
Outline s Discrete Mathematics I MATH/COSC 1056E Julien Dompierre Department of Mathematics and Computer Science Laurentian University Sudbury, August 6, 2008 Using to Build Arguments and Quantifiers Outline
More informationLogic 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