Propositional Logic Lecture 2: Sep 9. Conditional Statement If p then q p is called the hypothesis; q is called the conclusion “If your GPA is 4.0, then.

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
Logic & Critical Reasoning
Propositional Logic Lecture 10: Oct 29.
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.
1 Introduction to Abstract Mathematics Valid AND Invalid Arguments 2.3 Instructor: Hayk Melikya
Logic ChAPTER 3 1. Truth Tables and Validity of Arguments
John Rosson Thursday February 15, 2007 Survey of Mathematical Ideas Math 100 Chapter 3, Logic.
CS128 – Discrete Mathematics for Computer Science
Logic 3 Tautological Implications and Tautological Equivalences
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.
Discrete Mathematics Lecture 1 Logic of Compound Statements Harper Langston New York University.
Logic and Proof. Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Logic: Connectives AND OR NOT P Q (P ^ Q) T F P Q (P v Q) T F P ~P T F
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
1 Inference Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
1. 2 Day 1Intro Day 2Chapter 1 Day 3Chapter 2 Day 4Chapter 3 Day 5Chapter 4 Day 6Chapter 4 Day 7Chapter 4 Day 8EXAM #1 40% of Exam 1 60% of Exam 1 warm-up.
Through the Looking Glass, 1865
Propositional Logic Lecture 1: Sep 2. Content 1.Mathematical proof (what and why) 2.Logic, basic operators 3.Using simple operators to construct any operator.
Conditional Statements
CSE 311 Foundations of Computing I Autumn 2011 Lecture 2 More Propositional Logic Application: Circuits Propositional Equivalence.
Propositional Logic 7/16/ Propositional Logic A proposition is a statement that is either true or false. We give propositions names such as p, q,
3.2 – Truth Tables and Equivalent Statements
Logic ChAPTER 3.
Validity: Long and short truth tables Sign In! Week 10! Homework Due Review: MP,MT,CA Validity: Long truth tables Short truth table method Evaluations!
The Foundations: Logic and Proofs
Propositional Logic.
Intro to Discrete Structures
Chapter 1 Section 1.4 More on Conditionals. There are three statements that are related to a conditional statement. They are called the converse, inverse.
Section 1.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
Valid and Invalid Arguments
Conditional Statements CS 2312, Discrete Structures II Poorvi L. Vora, GW.
Reason and Argument Chapter 6 (2/3). A symbol for the exclusive ‘or’ We will use ұ for the exclusive ‘or’ Strictly speaking, this connective is not necessary.
Proofs1 Elementary Discrete Mathematics Jim Skon.
(CSC 102) Lecture 3 Discrete Structures. Previous Lecture Summary Logical Equivalences. De Morgan’s laws. Tautologies and Contradictions. Laws of Logic.
Math 240: Transition to Advanced Math Deductive reasoning: logic is used to draw conclusions based on statements accepted as true. Thus conclusions are.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Discrete Mathematics Lecture1 Miss.Amal Alshardy.
Chapter 3 section 3. Conditional pqpqpq TTT TFF FTT FFT The p is called the hypothesis and the q is called the conclusion.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
LOGIC Lesson 2.1. What is an on-the-spot Quiz  This quiz is defined by me.  While I’m having my lectures, you have to be alert.  Because there are.
Chapter 3: Semantics PHIL 121: Methods of Reasoning March 13, 2013 Instructor:Karin Howe Binghamton University.
Conditional Statements
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.
Chapter 8 – Symbolic Logic Professor D’Ascoli. Symbolic Logic Because the appraisal of arguments is made difficult by the peculiarities of natural language,
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
How do I show that two compound propositions are logically equivalent?
LOGIC.
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
Statement Forms and Material Equivalence Kareem Khalifa Department of Philosophy Middlebury College.
Joan Ridgway. If a proposition is not indeterminate then it is either true (T) or false (F). True and False are complementary events. For two propositions,
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
Outline Logic Propositional Logic Well formed formula Truth table
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.
Conditional Statements Lecture 2 Section 1.2 Fri, Jan 20, 2006.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
Lecture 10 Methods of Proof CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Reasoning and Proof Chapter Use Inductive Reasoning Conjecture- an unproven statement based on an observation Inductive reasoning- finding a pattern.
Logic and Truth Tables Winter 2012 COMP 1380 Discrete Structures I Computing Science Thompson Rivers University.
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
Chapter 1 Logic and proofs
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.
Propositional Logic.
Argument An argument is a sequence of statements.
Propositional Logic.
Presentation transcript:

Propositional Logic Lecture 2: Sep 9

Conditional Statement If p then q p is called the hypothesis; q is called the conclusion “If your GPA is 4.0, then you don’t need to pay tuition fee.”The department says: When is the above sentence false? It is false when your GPA is 4.0 but you still have to pay tuition fee. But it is not false if your GPA is below 4.0. Another example: “If there is typhoon T8 today, then there is no class.” When is the above sentence false?

Logic Operator T T F T P Q FF TF FT TT QP Convention: if we don’t say anything wrong, then it is not false, and thus true.

If-Then as Or T T F T P Q FF TF FT TT QP Idea 2: Look at the false rows, negate and take the “and”. If you don’t give me all your money, then I will kill you. Either you give me all your money or I will kill you (or both). If you talk to her, then you can never talk to me. Either you don’t talk to her or you can never talk to me (or both).

Negation of If-Then If your GPA is 4.0, then you don’t need to pay tuition fee. Your term GPA is 4.0 and you still need to pay tuition fee. If my computer is not working, then I cannot finish my homework. My computer is not working but I can finish my homework. previous slide DeMorgan

Contrapositive The contrapositive of “if p then q” is “if ~q then ~p”. Statement: If x 2 is an even number, then x is an even number. Statement: If you are a CS year 1 student, then you are taking CSC Contrapositive: If x is an odd number, then x 2 is an odd number. Contrapositive: If you are not taking CSC 2110, then you are not a CS year 1 student. Fact: A conditional statement is logically equivalent to its contrapositive.

Proofs Statement: If P, then Q Contrapositive: If Q, then P. FFT TFF FTT TTT TTT TFF FTT FFT

If, Only-If You will succeed if you work hand. You will succeed only if you work hard. r if s means “if s then r” We also say s is a sufficient condition for r. You will succeed if and only if you work hard. p if and only if (iff) q means p and q are logically equivalent. r only if s means “if r then s” We also say s is a necessary condition for r.

Math vs English Parent: if you don’t clean your room, then you can’t watch a DVD. CD This sentence says In real life it also means So Mathematician: if a number x greater than 2 is not an odd number, then x is not a prime number. This sentence says But of course it doesn’t mean

Necessary, Sufficient Condition Mathematician: if a number x greater than 2 is not an odd number, then x is not a prime number. This sentence says But of course it doesn’t mean Being an odd number > 2 is a necessary condition for this number to be prime. Being a prime number > 2 is a sufficient condition for this number to be odd.

Necessary AND Sufficient Condition T F F T P Q FF TF FT TT QP Note: P Q is equivalent to (P Q) (Q P) Note: P Q is equivalent to (P Q) ( P Q) Is the statement “x is an even number if and only if x 2 is an even number” true?

Argument An argument is a sequence of statements. All statements but the final one are called assumptions or hypothesis. The final statement is called the conclusion. An argument is valid if: whenever all the assumptions are true, then the conclusion is true. If today is Wednesday, then yesterday is Tuesday. Today is Wednesday. Yesterday is Tuesday.

Modus Ponens If p then q. p q pqp→qpq TTTTT TFFTF FTTFT FFTFF Modus ponens is Latin meaning “method of affirming”. assumptions conclusion If typhoon, then class cancelled. Typhoon. Class cancelled.

Modus Tollens If p then q. ~q ~p pqp→q~q~p TTTFF TFFTF FTTFT FFTTT Modus tollens is Latin meaning “method of denying”. assumptions conclusion If typhoon, then class cancelled. Class not cancelled. No typhoon.

Equivalence A student is trying to prove that propositions P, Q, and R are all true. She proceeds as follows. First, she proves three facts: P implies Q Q implies R R implies P. Then she concludes, ``Thus P, Q, and R are all true.'' Proposed argument: Is it valid? assumption conclusion

Valid Argument? assumptionsconclusion PQR TTT TTF TFT TFF FTT FTF FFT FFF TTT TFT FTT FTT TTF TFT TTF TTT OK? Tyes F F F F F F Fno To prove an argument is not valid, we just need to find a counterexample. Is it valid?

Valid Arguments? If p then q. q p If you are a fish, then you drink water. You drink water. You are a fish. pqp→qqp TTTTT TFFFT FTTTF FFTFF assumptions conclusion Assumptions are true, but not the conclusion.

Valid Arguments? If p then q. ~p ~q If you are a fish, then you drink water. You are not a fish. You do not drink water. pqp→q~p~q TTTFF TFFFT FTTTF FFTTT assumptions conclusion

Exercises

More Exercises Valid argument True conclusion True conclusion Valid argument

Contradiction If you can show that the assumption that the statement p is false leads logically to a contradiction, then you can conclude that p is true. You are working as a clerk. If you have won Mark 6, then you would not work as a clerk. You have not won Mark 6.

Knights and Knaves Knights always tell the truth. Knaves always lie. A says: B is a knight. B says: A and I are of opposite type. Suppose A is a knight. Then B is a knight (because what A says is true). Then A is a knave (because what B says is true) A contradiction. So A must be a knave. So B must be a knave (because what A says is false).

“The sentence below is false.” “The sentence above is true.” Which is true? Which is false?