Learning Objectives  To define a proposition  To form a compound proposition using connectives  To determine the truth values of compound propositions.

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: The Moon is made of green cheese. Trenton.
2.2 Conditional Statements. Goals Identify statements which are conditional Identify the antecedent and consequent of a conditional statement Negate conditional.
Logic Chapter 2. Proposition "Proposition" can be defined as a declarative statement having a specific truth-value, true or false. Examples: 2 is a odd.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
1 Section 1.1 Logic. 2 Proposition Statement that is either true or false –can’t be both –in English, must contain a form of “to be” Examples: –Cate Sheller.
Copyright © Cengage Learning. All rights reserved.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Adapted from Discrete Math
Predicates and Quantifiers
Basics On Logic.
Chapter 3 – Introduction to Logic The initial motivation for the study of logic was to learn to distinguish good arguments from bad arguments. Logic is.
The Foundations: Logic and Proofs
Propositions and Truth Tables
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
2009/9 1 Logic and Proofs §1.1 Introduction §1.2 Propositional Equivalences §1.3 Predicates and Quantifiers §1.4 Nested Quantifiers §1.5~7 Methods of Proofs.
Chapter 8 Logic DP Studies. Content A Propositions B Compound propositions C Truth tables and logical equivalence D Implication and equivalence E Converse,
Discrete Maths 2. Propositional Logic Objective
Discrete Mathematics and Its Applications
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Ch.1 (Part 1): The Foundations: Logic and Proofs Introduction.
Chapter 1: The Foundations: Logic and Proofs
Review I Rosen , 3.1 Know your definitions!
CS 173, Lecture B August 27, 2015 Tandy Warnow. Proofs You want to prove that some statement A is true. You can try to prove it directly, or you can prove.
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.1 Logic Statements.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements
Lecture 4. CONDITIONAL STATEMENTS: Consider the statement: "If you earn an A in Math, then I'll buy you a computer." This statement is made up of two.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
Chapter 3: Introduction to Logic. Logic Main goal: use logic to analyze arguments (claims) to see if they are valid or invalid. This is useful for math.
MADAM SITI AISYAH ZAKARIA. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC LOGICAL CONNECTIVES CONDITIONAL STATEMENT.
Predicates and Quantified Statements
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Week 4 - Friday.  What did we talk about last time?  Floor and ceiling  Proof by contradiction.
Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.
Mathematics for Comter I Lecture 3: Logic (2) Propositional Equivalences Predicates and Quantifiers.
 To combine propositions using connectives  To construct the truth table of a given compound proposition  To define de Morgan Law for logic  To define.
Discrete Mathematics Lecture # 4. Conditional Statements or Implication  If p and q are statement variables, the conditional of q by p is “If p then.
Conditional statement or implication IF p then q is denoted p ⇒ q p is the antecedent or hypothesis q is the consequent or conclusion ⇒ means IF…THEN.
Propositional and predicate logic
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
Simple Logic.
Chapter 1 Propositional Logic
Logic The study of correct reasoning.
Discrete Mathematical
Logic Day #2 Math Studies IB NPHS Miss Rose
CSNB 143 Discrete Mathematical Structures
Lecture 1 – Formal Logic.
Niu Kun Discrete Mathematics Chapter 1 The Foundations: Logic and Proof, Sets, and Functions Niu Kun 离散数学.
Logic.
Ch.1 (Part 1): The Foundations: Logic and Proofs
Negations of Quantified Statements
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
2 Chapter Introduction to Logic and Sets
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
(1.4) An Introduction to Logic
Discrete Mathematics and Its Applications Kenneth H
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Write the negation of each of the following propositions without using any form of the word “not”: Today is Thursday Today is Monday or Tuesday or Wednesday.
Presentation transcript:

Learning Objectives  To define a proposition  To form a compound proposition using connectives  To determine the truth values of compound propositions based on the truth values of their constituent propositions  To use the different ways of expressing implication  To determine the equivalence of two propositions RMIT University; Taylor's College

4.1 Logic Logic is a study of reasoning. Example 4.1.1: All Taylor’s students are hardworking. Hardworking students will eventually smarter. Therefore, all Taylor’s students will eventually smarter. Logic is of no help to determine whether a statement is true or false. However, if the first two statements are true, logic assures that the third statement is true.

4.2 Propositions Logic involves statements, which are usually called propositions. A proposition is a statements can be either true or false but not both. Examples 4.2.1: Determine true or false for the following propositions: Proposition P: All dogs are black. Proposition Q: Obama is the president of Singapore. Proposition R: Malaysia do not have winter. RMIT University; Taylor's College

Truth Values Every proposition has a truth value of either T (for “true”) or F (for “false”) If P is true, ~P is false. If P is false, ~P is true. RMIT University; Taylor's College

We combine propositions using connectives such as AND, OR, IMPLIES, IS EQUIVALENT TO (binary connectives) We also negate propositions using NOT (unary connective) Examples: P and Q: All dogs are black, and Obama is the president of Singapore. P or R: All dogs are black, or Malaysia do not have winter. RMIT University; Taylor's College Connectives

The Connective “OR” Exclusive-or (can’t be both) Today is Monday or Tuesday. Inclusive-or (Possible to be both) You’ll pass if you do very well in the mid-semester test or in the final exam. (You’ll pass, if you do well in both exam.). You’ll know the answer if I tell you, or if someone else tell you. (You’ll still know the answer, if we both tell you.). In Math's and in logic, “or” means “inclusive-or” unless otherwise specified. RMIT University; Taylor's College

Negation Negation of a proposition P, is the proposition NOT P. Example: Let P: The moon is bigger than the sun. The negation is – not P: The moon is NOT bigger than the sun. Equivalently – The moon is smaller than (or possibly of equal size to) the sun. We use various symbols for “not”: not P ~P

Example Which of the following is the negation of “all camels have humps”? 1. No camels have humps. 2. Some camels have humps. 3. Some camels don’t have humps. 4. All camels don’t have humps. 5. Some camels don’t know whether or not they have humps. RMIT University; Taylor's College

Implication If P is true then Q is true, or if P then Q. P implies Q (Some texts use P  Q) Examples: If a number is bigger than 3 then it is bigger than 2. If 3 is a negative number then the moon is made of green cheese. (This is true because 3 is not a negative number) RMIT University; Taylor's College

Implication If it is raining, then I am at home. PQ True It’s raining True I am at home True It’s raining False I am not at home False It’s not raining True I am at home True False It’s not raining False I am not at home True

RMIT University; Taylor's College If it is a cat, it is an animal.if P, Q It is an animal if it is a cat.Q if P It is a cat only if it is an animal.P only if Q Being a cat is sufficient for being an animal.P is sufficient for Q Being an animal is necessary for being a cat. (It can’t be a cat if it is not an animal.) Q is necessary for P It is an animal whenever it is a cat.Q (is true) whenever P (is true) If it is a cat then it is an animal.if P then Q It is a cat implies that it is an animal.P implies Q ExampleWays to Write Implication P: It is a cat. Q: It is an animal.

More About Implications RMIT University; Taylor's College If it is not a cat, then it is not an animal. Inverse If it is not an animal, then it is not a cat. Contrapositive If it is an animal, then it is a cat.Converse Exampleis…Its…

More About Implications RMIT University; Taylor's College It can be shown that every implication is logically equivalent to its contrapositive. TrueIf Bruce is not an animal then Bruce is not a rabbit. Contrapositive An implication may be true while its converse is false (and vice versa) FalseIf Bruce is an animal then Bruce is a rabbit. Converse P: Bruce is a rabbit. Q: Bruce is an animal. If Bruce is a rabbit then Bruce is an animal. [ True ]

“Some” In formal logic, “some” means “at least one”. It includes the possibility of “all” as a special case. Example: Some dogs are animals. True. All dogs are animals. Therefore, some dogs are animals RMIT University; Taylor's College

Quantifiers These are words or phrases like: some all none there exists most They get applied to variables to create more complicated statements RMIT University; Taylor's College True/FalseWith QuantifiersVariableStatement TrueThere exists a positive integer which is smaller than every other positive integer. Positive integers Positive integers are smaller than every other positive integer. TrueNo rational numbers equal π.Rational numbers Rational numbers equal π. FalseAll integers have real square roots.Integers Integers have real square roots. TrueSome integers are positive.Integers Integers are positive.

Examples Which of the following are true? 1. Some integers are real numbers. 2. Most integers are real numbers. 3. All integers are real numbers. 4. Some real numbers are irrational. 5. All real numbers are irrational. RMIT University; Taylor's College

Equivalence If whenever P is true, Q is true, and also whenever Q is true, P is true, We say that P is equivalent to Q In words: P is equivalent to Q P if and only if Q P is necessary and sufficient for Q

Note on Equivalence RMIT University; Taylor's College means and P: He study in Taylor’s Q: He is a student of Taylor’s If he study in Taylor’s, then, he is a student of Taylor’s If he is a student of Taylor’s, then, he study in Taylor’s Therefore, P and Q are equivalence.