Test #2 Practice MGF 1106 Summer 2011.

Slides:



Advertisements
Similar presentations
TRUTH TABLES Section 1.3.
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.
Tutorial 1: Logic Peter Poon. Self Introduction You can call me Peter Office: SHB117 Office hour:
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.
Logic ChAPTER 3 1. Truth Tables and Validity of Arguments
DEDUCTIVE REASONING: PROPOSITIONAL LOGIC Purposes: To analyze complex claims and deductive argument forms To determine what arguments are valid or not.
SEVENTH EDITION and EXPANDED SEVENTH EDITION
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.
Homework 3.
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.
Logic ChAPTER 3.
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.
Normal or Canonical Forms Rosen 1.2 (exercises). Logical Operators  - Disjunction  - Conjunction  - Negation  - Implication p  q   p  q  - Exclusive.
The Foundations: Logic and Proofs
1.1 Sets and Logic Set – a collection of objects. Set brackets {} are used to enclose the elements of a set. Example: {1, 2, 5, 9} Elements – objects inside.
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.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
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.
2.5 Verifying Arguments Write arguments symbolically. Determine when arguments are valid or invalid. Recognize form of standard arguments. Recognize common.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Chapter 8 Logic DP Studies. Content A Propositions B Compound propositions C Truth tables and logical equivalence D Implication and equivalence E Converse,
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
Valid and Invalid Arguments
Logic Eleanor Roosevelt High School Geometry Mr. Chin-Sung Lin.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Ch.2 Reasoning and Proof Pages Inductive Reasoning and Conjecture (p.62) - A conjecture is an educated guess based on known information.
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 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.
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?
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.
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
Lesson 20 INTERPRETING TRUTH TABLES. Review Conditional Statements (Less. 17) Original If p, then q. Converse If q, then p. Inverse If ~p, then ~q. Contrapositive.
The Foundations: Logic and Proof, Sets, and Foundations PROPOSITIONS A proposition is a declarative sentence that is either True or False, but not the.
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
Boolean Logic.
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.
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.
Assign Yourself and Do Now Thursday, January 10, 2013.
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
Introduction to Discrete Mathematics Lecture 1: Sep 6 AB C a = qb+r gcd(a,b) = gcd(b,r)
Simple Logic.
Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.
Chapter 1 Propositional Logic
2. The Logic of Compound Statements Summary
Chapter 8 Logic Topics
2 Chapter Introduction to Logic and Sets
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
3.5 Symbolic Arguments.
Section 3.4 Equivalent Statements
TRUTH TABLES continued.
Logic 3.1 Statements and Logical Connectives
1 Chapter An Introduction to Problem Solving
1 Chapter An Introduction to Problem Solving
Statements of Symbolic Logic
Section 3.4 Equivalent Statements
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
3.5 Symbolic Arguments.
Presentation transcript:

Test #2 Practice MGF 1106 Summer 2011

3.1 Statements and Logical Connectives

Question #1 Indicate whether the statement is a simple or a compound statement. If it is a compound statement, indicate whether it is a negation, conjunction, disjunction, conditional, or biconditional by using both the word and its appropriate symbol. It is false that whales are fish and bats are birds. Compound; negation; ~ Compound; disjunction; V Compound; conjunction;  Compound; biconditional; 

Question #1 Indicate whether the statement is a simple or a compound statement. If it is a compound statement, indicate whether it is a negation, conjunction, disjunction, conditional, or biconditional by using both the word and its appropriate symbol. It is false that whales are fish and bats are birds. Compound; negation; ~ Compound; disjunction; V Compound; conjunction;  Compound; biconditional; 

Question #2 Write a negation of the statement. All dinosaurs were carnivores. Some dinosaurs were carnivores. All dinosaurs were not carnivores. Some dinosaurs were not carnivores. No dinosaurs were carnivores.

Question #2 Write a negation of the statement. All dinosaurs were carnivores. Some dinosaurs were carnivores. All dinosaurs were not carnivores. Some dinosaurs were not carnivores. No dinosaurs were carnivores.

Question #3 Let p represent the statement, “Jim plays football”, and let q represent “Michael plays basketball”. Convert the compound statements into symbols. It is not the case that Jim does not play football and Michael does not play basketball. ~(p V q) ~p  ~q ~(~p V ~q) ~(~p  ~q)

Question #3 Let p represent the statement, “Jim plays football”, and let q represent “Michael plays basketball”. Convert the compound statements into symbols. It is not the case that Jim does not play football and Michael does not play basketball. ~(p V q) ~p  ~q ~(~p V ~q) ~(~p  ~q)

Question #4 Write the compound statement in symbols. r = “The food is good,” p = “I eat too much,” q = “I’ll exercise.” I’ll exercise if I eat too much. q  p p V q p  q q  p

Question #4 Write the compound statement in symbols. r = “The food is good,” p = “I eat too much,” q = “I’ll exercise.” I’ll exercise if I eat too much. q  p p V q p  q q  p

Question #5 Convert the compound statement into words. p = “Babies eat bananas.” q = “Babies wear plastic bibs.” p ∨ q Babies eat bananas or babies do not wear plastic bibs. Babies eat bananas or babies wear plastic bibs. Babies wear plastic bibs and babies eat bananas. Babies eat bananas and babies wear plastic bibs.

Question #5 Convert the compound statement into words. p = “Babies eat bananas.” q = “Babies wear plastic bibs.” p ∨ q Babies eat bananas or babies do not wear plastic bibs. Babies eat bananas or babies wear plastic bibs. Babies wear plastic bibs and babies eat bananas. Babies eat bananas and babies wear plastic bibs.

Question #6 Write the compound statement in words. r = “The puppy is trained.” p = “The puppy behaves well.” q = “His owners are happy.” r ∧ (p → q) The puppy is trained if the puppy behaves well and his owners are happy. The puppy is trained, or if the puppy behaves well then his owners are happy. If the puppy is trained then the puppy behaves well, and his owners are happy. The puppy is trained, and if the puppy behaves well then his owners are happy.

Question #6 Write the compound statement in words. r = “The puppy is trained.” p = “The puppy behaves well.” q = “His owners are happy.” r ∧ (p → q) The puppy is trained if the puppy behaves well and his owners are happy. The puppy is trained, or if the puppy behaves well then his owners are happy. If the puppy is trained then the puppy behaves well, and his owners are happy. The puppy is trained, and if the puppy behaves well then his owners are happy.

Question #7 A restaurant has the following statement on the menu: “All dinners are served with a choice of: Soup or Salad, and Potatoes or Pasta, and Corn or Beans.” A customer asks for soup, salad, and corn. Is this order permissible? Yes No

Question #7 A restaurant has the following statement on the menu: “All dinners are served with a choice of: Soup or Salad, and Potatoes or Pasta, and Corn or Beans.” A customer asks for soup, salad, and corn. Is this order permissible? Yes No

Question #8 Select letters to represent the simple statements and write each statement symbolically by using parentheses then indicate whether the statement is a negation, conjunction, disjunction, conditional, or biconditional. If a number is divisible by 3 and the number is not divisible by 2 then the number is not divisible by 6. p ∧ (~q → ~r); conjunction (p ∧ ~q) → (~r); conditional (p ∧ ~q) ↔ (~r); biconditional p ∨ (~q → ~r); disjunction

Question #8 Select letters to represent the simple statements and write each statement symbolically by using parentheses then indicate whether the statement is a negation, conjunction, disjunction, conditional, or biconditional. If a number is divisible by 3 and the number is not divisible by 2 then the number is not divisible by 6. p ∧ (~q → ~r); conjunction (p ∧ ~q) → (~r); conditional (p ∧ ~q) ↔ (~r); biconditional p ∨ (~q → ~r); disjunction

3.2 Truth Tables for Negation, Conjunction, and Disjunction

Question #9 Determine how many distinct cases must be listed in the truth table for the compound statement. (p ∨ q) ∨ (~r ∨ s) ∧ ~t 8 32 10 25 (p ∨ q) ∨ (~r ∨ s) ∧ ~t

Question #9 Determine how many distinct cases must be listed in the truth table for the compound statement. (p ∨ q) ∨ (~r ∨ s) ∧ ~t 8 32 10 25 (p ∨ q) ∨ (~r ∨ s) ∧ ~t

Question #10 Construct a truth table for the statement. (s ∧ q) ∧ (~q ∨ t) a) b) s q t (s  q)  (~q V t) T F s q t (s  q)  (~q V t) T F

Question #10 Construct a truth table for the statement. (s ∧ q) ∧ (~q ∨ t) a) b) s q t (s  q)  (~q V t) T F s q t (s  q)  (~q V t) T F

Question #11 Translate the statement into symbols then construct a truth table. p = At most, 100 guests arrived at the wedding reception. q = There was a lot of cake left over. It is not the case that, at most, 100 guests arrived at the wedding reception and there was a lot of cake left over. a) b) c) d) p q ~(p  q) T F p q ~(p  q) T F p q ~(p  q) T F p q ~(p  q) T F

Question #11 Translate the statement into symbols then construct a truth table. p = At most, 100 guests arrived at the wedding reception. q = There was a lot of cake left over. It is not the case that, at most, 100 guests arrived at the wedding reception and there was a lot of cake left over. a) b) c) d) p q ~(p  q) T F p q ~(p  q) T F p q ~(p  q) T F p q ~(p  q) T F

Question #12 Let p represent a true statement, while q and r represent false statements. Find the truth value of the compound statement. ~[~p ∧ (~q ∨ p)] true false

Question #12 Let p represent a true statement, while q and r represent false statements. Find the truth value of the compound statement. ~[~p ∧ (~q ∨ p)] true false

Question #13 Determine the truth value for each simple statement. Then use these truth values to determine the truth value of the compound statement. Use a reference source such as an almanac or the chart or graph provided. Ronald Reagan was President of the United States or Marie Curie won the Nobel Prize, and Michael Jordan played soccer. true false

Question #13 Determine the truth value for each simple statement. Then use these truth values to determine the truth value of the compound statement. Use a reference source such as an almanac or the chart or graph provided. Ronald Reagan was President of the United States or Marie Curie won the Nobel Prize, and Michael Jordan played soccer. true false

3.3 Truth Tables for the Conditional and Biconditional

Question #14 Construct a truth table for the statement. (~p → q) ↔ (q → ~r) a) b) p q r (~pq)  (q~r) T F p q r (~pq)  (q~r) T F

Question #14 Construct a truth table for the statement. (~p → q) ↔ (q → ~r) a) b) p q r (~pq)  (q~r) T F p q r (~pq)  (q~r) T F

Question #15 Write the compound statement in symbols. Then construct a truth table for the symbolic statement. Let r = “The food is good,” p = “I eat too much,” q = “I’ll exercise.” The food is good and if I eat too much, then I’ll exercise. a) r ∧ (p → q) b) (r ∧ p) → q c) (r ∧ p) → q p q r  (pq) T F p q r  (pq) T F p q r  (pq) T F

Question #15 Write the compound statement in symbols. Then construct a truth table for the symbolic statement. Let r = “The food is good,” p = “I eat too much,” q = “I’ll exercise.” The food is good and if I eat too much, then I’ll exercise. a) r ∧ (p → q) b) (r ∧ p) → q c) (r ∧ p) → q p q r  (pq) T F p q r  (pq) T F p q r  (pq) T F

Question #16 Determine whether the statement is a self-contradiction, an implication, a tautology (that is not also an implication), or none of these. [(p → q) ∧ (q → r)] → (p → r) Self-contradiction Implication Tautology None of these

Question #16 Determine whether the statement is a self-contradiction, an implication, a tautology (that is not also an implication), or none of these. [(p → q) ∧ (q → r)] → (p → r) Self-contradiction Implication Tautology None of these

Question #17 Given p is true, q is true, and r is false, find the truth value of the statement. ~[(~q → r) ↔(q ∨ r)] False True

Question #17 Given p is true, q is true, and r is false, find the truth value of the statement. ~[(~q → r) ↔(q ∨ r)] False True

Question #18 Determine the truth value for each simple statement. Then, using the truth values, give the truth value of the compound statement. 8 × 2 = 20 if and only if 7 + 8 = 15. True False

Question #18 Determine the truth value for each simple statement. Then, using the truth values, give the truth value of the compound statement. 8 × 2 = 20 if and only if 7 + 8 = 15. True False

Question #19 Use the information given in the chart or graph to determine the truth values of the simple statements. Then determine the truth value of the compound statement given. Moon 2 has a diameter of 5-9 km and Moon 4 may have an atmosphere, or Moon 5 does not have a diameter of 10-17 km. a) False b) True Planet X  Moon 1 Diameter of Moons: May have:  Moon 2  5-9 km  Water ice  Moon 3  10-17 km  atmosphere  Moon 4  18-23 km  both  Moon 5

Question #19 Use the information given in the chart or graph to determine the truth values of the simple statements. Then determine the truth value of the compound statement given. Moon 2 has a diameter of 5-9 km and Moon 4 may have an atmosphere, or Moon 5 does not have a diameter of 10-17 km. a) False b) True Planet X  Moon 1 Diameter of Moons: May have:  Moon 2  5-9 km  Water ice  Moon 3  10-17 km  atmosphere  Moon 4  18-23 km  both  Moon 5

3.4 Equivalent Statements

Question #20 Use DeMorgan’s laws or a truth table to determine whether the two statements are equivalent. ~(p ∨ q) , ~p ∧ ~q Equivalent Not equivalent

Question #20 Use DeMorgan’s laws or a truth table to determine whether the two statements are equivalent. ~(p ∨ q) , ~p ∧ ~q Equivalent Not equivalent

Question #21 Write an equivalent sentence for the statement. If it is raining, you take your coat. (Hint: Use the fact that p → q is equivalent to ~p ∨ q.) It is not raining and you take your coat. It is not raining and you do not take your coat. If it is raining, you do not take your coat. It is not raining or you take your coat.

Question #21 Write an equivalent sentence for the statement. If it is raining, you take your coat. (Hint: Use the fact that p → q is equivalent to ~p ∨ q.) It is not raining and you take your coat. It is not raining and you do not take your coat. If it is raining, you do not take your coat. It is not raining or you take your coat.

Question #22 Write the indicated statement. Use De Morgan’s Laws if necessary. If the moon is out, then we will start a campfire and we will roast marshmallows. Inverse If we do not start a campfire or we do not roast marshmallows, then the moon is not out. If the moon is not out, then we will start a campfire but we will not roast marshmallows. If we start a campfire and we roast marshmallows, then the moon is out. If the moon is not out, then we will not start a campfire or we will not roast marshmallows. If the moon is not out, then we will not start a campfire or we will not roast marshmallows.

Question #22 Write the indicated statement. Use De Morgan’s Laws if necessary. If the moon is out, then we will start a campfire and we will roast marshmallows. Inverse If we do not start a campfire or we do not roast marshmallows, then the moon is not out. If the moon is not out, then we will start a campfire but we will not roast marshmallows. If we start a campfire and we roast marshmallows, then the moon is out. If the moon is not out, then we will not start a campfire or we will not roast marshmallows. If the moon is not out, then we will not start a campfire or we will not roast marshmallows.

Question #23 Write the contrapositive of the statement. Then use the contrapositive to determine whether the conditional statement is true or false. If 1/n is not an integer, then n is not an integer. If n is an integer, then 1/n is an integer. false If 1/n is an integer, then n is an integer. true If n is an integer, then 1/n is an integer. true If 1/n is an integer, then n is an integer. false

Question #23 Write the contrapositive of the statement. Then use the contrapositive to determine whether the conditional statement is true or false. If 1/n is not an integer, then n is not an integer. If n is an integer, then 1/n is an integer. false If 1/n is an integer, then n is an integer. true If n is an integer, then 1/n is an integer. true If 1/n is an integer, then n is an integer. false

Question #24 I and II are equivalent II and III are equivalent Determine which, if any, of the three statements are equivalent. I) If the garden needs watering, then the garden needs weeding or the garden is not lovely. II) The garden needs watering, and it is false that the garden does not need weeding and the garden is not lovely. III) The garden needs watering, and the garden needs weeding or the garden is lovely. I and II are equivalent II and III are equivalent I and III are equivalent None are equivalent

Question #24 I and II are equivalent II and III are equivalent Determine which, if any, of the three statements are equivalent. I) If the garden needs watering, then the garden needs weeding or the garden is not lovely. II) The garden needs watering, and it is false that the garden does not need weeding and the garden is not lovely. III) The garden needs watering, and the garden needs weeding or the garden is lovely. I and II are equivalent II and III are equivalent I and III are equivalent None are equivalent

3.5 Symbolic Arguments

Question #25 Use truth tables to test the validity of the argument. p ∨ q q ∴ p valid invalid

Question #25 Use truth tables to test the validity of the argument. p ∨ q q ∴ p valid invalid

Question #26 Determine if the argument is valid or invalid. Give a reason to justify answer. If you wear a tie, then you look natty. You do not look natty. ∴ You are not wearing a tie. Valid by the law of contraposition Invalid by fallacy of the inverse Valid by disjunctive syllogism Invalid by fallacy of the converse

Question #26 Determine if the argument is valid or invalid. Give a reason to justify answer. If you wear a tie, then you look natty. You do not look natty. ∴ You are not wearing a tie. Valid by the law of contraposition Invalid by fallacy of the inverse Valid by disjunctive syllogism Invalid by fallacy of the converse

Question #27 Determine whether the argument is valid or invalid. Sam plays tennis or George is not a man. If George is not a man, then Betsy does not win the award. Betsy wins the award. Therefore, Sam does not play tennis. Invalid Valid

Question #27 Determine whether the argument is valid or invalid. Sam plays tennis or George is not a man. If George is not a man, then Betsy does not win the award. Betsy wins the award. Therefore, Sam does not play tennis. Invalid Valid

Question #28 Use the method of writing each premise in symbols in order to arrive at a valid conclusion. Smiling people are happy. Alert people are not happy. Careful drivers are alert. Careless drivers have accidents. Therefore, ... Careful drivers have accidents. Careful drivers are happy. People who smile are alert. People who smile have accidents.

Question #28 Use the method of writing each premise in symbols in order to arrive at a valid conclusion. Smiling people are happy. Alert people are not happy. Careful drivers are alert. Careless drivers have accidents. Therefore, ... Careful drivers have accidents. Careful drivers are happy. People who smile are alert. People who smile have accidents.

3.6 Euler Diagrams and Syllogistic Arguments

Question #29 Use an Euler diagram to determine whether the syllogism is valid or invalid. All businessmen wear suits. Aaron wears a suit. ∴ Aaron is a businessman. Invalid Valid

Question #29 Use an Euler diagram to determine whether the syllogism is valid or invalid. All businessmen wear suits. Aaron wears a suit. ∴ Aaron is a businessman. Invalid Valid