Logic ChAPTER 3.

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

Logic ChAPTER 3.
TRUTH TABLES Section 1.3.
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.
Constructing a Truth Table
Chapter 3 section 2. Please form your groups The 1 st column represents all possibilities for the statement that can be either True or False. The 2 nd.
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.
The Conditional & Biconditional MATH 102 Contemporary Math S. Rook.
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.
Philosophy 148 Chapter 6. Truth-Functional Logic Chapter 6 introduces a formal means to determine whether arguments are valid, so that there is never.
DEDUCTIVE REASONING: PROPOSITIONAL LOGIC Purposes: To analyze complex claims and deductive argument forms To determine what arguments are valid or not.
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.
2/17/2008Sultan Almuhammadi1 ICS Logic & Sets (An Overview) Week 1.
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
Through the Looking Glass, 1865
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,
Homework 3.
Truth Tables for Negation, Conjunction, and Disjunction.
3.2 – Truth Tables and Equivalent Statements
TRUTH TABLES. Introduction Statements have truth values They are either true or false but not both Statements may be simple or compound Compound statements.
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
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.
Conditional Statements M Deductive Reasoning Proceeds from a hypothesis to a conclusion. If p then q. p  q hypothesis  conclusion.
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.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
Valid and Invalid Arguments
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.
MATH 102 Contemporary Math S. Rook
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
Logic Eleanor Roosevelt High School Geometry Mr. Chin-Sung Lin.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Discrete Mathematics Lecture1 Miss.Amal Alshardy.
Predicate Logic. TRUTH-TABLE REMINDERS The problem people had the most trouble with was 1e: construct a truth-table for: (P & (~Q & R)) Many of you only.
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.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
3.3: Truth Tables. Types of Statements Negation: ~p Conjunction: p ˄ q (p and q) Disjunction: p V q (p or q, or both) Conditional: p → q (if p, then q)
Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements
Chapter 7 Logic, Sets, and Counting
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.
MAIN TOPIC : Statement, Open Sentences, and Truth Values Negation Compound Statement Equivalency, Tautology, Contradiction, and Contingency Converse, Inverse,
Warmup Answer the following True/False questions in your head: I have brown hair AND I am wearing glasses I am male OR I am wearing sneakers I am NOT male.
How do I show that two compound propositions are logically equivalent?
Truth Tables Geometry Unit 11, Lesson 6 Mrs. King.
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
Logic. Statements, Connectives, and Quantifiers In symbolic logic, we only care whether statements are true or false – not their content. In logic, a.
6.1 Logic Logic is not only the foundation of mathematics, but also is important in numerous fields including law, medicine, and science. Although the.
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
TRUTH TABLES. Introduction The truth value of a statement is the classification as true or false which denoted by T or F. A truth table is a listing of.
Notes - Truth Tables fun, fun, and more fun!!!!. A compound statement is created by combining two or more statements, p and q.
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,
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.
Mathematics for Computing Lecture 2: Computer Logic and Truth Tables Dr Andrew Purkiss-Trew Cancer Research UK
TRUTH TABLES Edited from the original by: Mimi Opkins CECS 100 Fall 2011 Thanks for the ppt.
Ms. Andrejko 2-2 Logic. Real World Legally Blonde.
Section 1.3 Implications. Vocabulary Words conditional operation ( ⇒ or →) conditional proposition conditional statement (implication statement) hypothesis.
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.
Aim 1.4: To work with conditionals and biconditionals Do Now: Determine the truth value of the following sentences: 1.9 is a prime number and New York.
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.
Logical functors and connectives. Negation: ¬ The function of the negation is to reverse the truth value of a given propositions (sentence). If A is true,
Presentation transcript:

Logic ChAPTER 3

The Conditional and the Biconditional 3.3

Truth Value of the Conditional Statement The conditional statement p → q (“if p then q”) is false only when p is true and q is false; otherwise, it is true. In p → q, statement p is called the antecedent and q the consequent.. p q p → q T F

Examples Find the truth value of each statement. a. If 2+2 = 22, then 22 = 4. b. If 2+2 = 4, then 8 = 5. c. If 2+2 = 22, then 8 = 4+4. TRUE FALSE TRUE

Reason: a. If 2+2 = 22, then 22 = 4. p: 2+2 = 22 q: 22 = 4 FALSE p → q ; F → F is T FALSE b. If 2+2 = 4, then 8 = 5. p: 2+2 = 4 q: 8 = 5 TRUE p → q ; T → F is F FALSE c. If 2+2 = 22, then 8 = 4+4. p: 2+2 = 22 q: 8 = 4+4 FALSE p → q ; F → T is T TRUE

Examples Find all the number replacements for x that make each sentence true. d. If 2 + 2 = 4, then x – 2 = 5. e. If 2 + 2 = 22, then x – 2 = 5. f. If x + 2 = 6, then 3 + 2 = 5. x = 7 x = any number x = any number

Reason: d. If 2+2=4, then x – 2 = 5. p: 2+2 = 4 q: x – 2 = 5 TRUE Refer to the truth table on slide three. Since p is true q must be true to have a true conclusion. Hence, x – 2 = 5 must be solved algebraically. x – 2 = 5 + 2 + 2 x = 7

Reason CONT’D: e. If 2 + 2 = 22, then x – 2 = 5. p: 2+2 = 22 q: x – 2 = 5 FALSE Refer to the truth table on slide three. Since p is false, the truth value of q is immaterial for the conclusion to be true. Hence, x may be any number.

Reason CONT’D: f. If x + 2 = 6, then 3 + 2 = 5. p: x + 2 = 6 q: 3 + 2 = 5 True Refer to the truth table on slide three. Since q is true, the truth value of p is immaterial for the conclusion to be true. Hence, x may be any number.

Definition of the Biconditional The biconditional is symbolized by p ↔ q (read as p if and only if q or p biconditional q).

Truth Value of the Biconditional Statement The biconditional statement p ↔ q is true only when p and q have the same truth values; otherwise, it is false. p q p ↔ q T F

Conditional Equivalence p q p → q T F p q ~p (~ p v q) T F T F T F

Examples Write each statement in symbolic form using ~ and ∨. Also write the statements in words. Recall that (p → q) ⇔ (~ p ∨ q). a. If the temperature is above 80˚ (a), then I will go to the beach (b). ~a ∨ b The temperature is not above 80˚, or I would go to the beach. b. If Mida is home by 5 (h), then dinner will be ready by 6 (r). ~h ∨ r Mida is not home by 5 or dinner will be ready by 6.

The statement “All even numbers are divisible by 2” can be translated as “If it is an even number, then it is divisible by 2.” In general, the statement “All ___ are ___” can be translated as “If it is a ___, then it is a ___.” Example: All dogs are mammals. If it is a dog, then it is a mammal.

Negation of a Conditional Statement p q p → q ~(p → q) T F p q ~p ~ p ∨ q ~ (~ p ∨ q) T F F T F T

Negation of a Conditional Statement CONT”D p q ~p ~ p ∨ q ~ (~ p ∨ q) T F p q ~q p Λ ~q T F F T F T

Examples Slides 13 and 14 verified that ~(p → q) is equivalent to p Λ ~q. This means that to negate an “if ___, then ___” statement, simply assert the if clause and deny the then clause. Write in words the negation of each statement. a. If you earn a lot of money, then you pay heavy taxes. You earn a lot of money but you do not pay heavy taxes. b. If Alice passes the test, then she gets the job. Alice passes the test but she does not get the job. END 17