Is this a statement? I am superman. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises.

Slides:

Advertisements

Similar presentations

1.3 Predicates and Quantifiers

Advertisements

Statements, Connectives, and Quantifiers

Is this a statement? I am superman. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises.

Chapter Two Symbolizing in Sentential Logic This chapter is a preliminary to the project of building a model of validity for sentential arguments. We.

2.2 Conditional Statements. Goals Identify statements which are conditional Identify the antecedent and consequent of a conditional statement Negate conditional.

Chapter 3 section 1.  A statement Is a declarative sentence that is either true or false. (using lower case letters p, q, r …) 2 Types of statement 

Symbolic Logic. Objectives Determine if a sentence or question is a statement or not. Write a sentence that represents the negation of a given statement.

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.

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.

SEVENTH EDITION and EXPANDED SEVENTH EDITION

Statements and Quantifiers

Logic In Part 2 Modules 1 through 5, our topic is symbolic logic. We will be studying the basic elements and forms that provide the structural foundations.

Survey of Mathematical Ideas Math 100 Chapter 3, Logic

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.

Adapted from Discrete Math

Conditional Statements and Logic 2.2 Ms. Verdino.

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.

Lecture 8 Introduction to Logic CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.

Chapter 3 – Introduction to Logic

Chapter 2 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.

Unit 2 – Week 5 Reasoning with Linear Equations and Inequalities Lesson 3 Students describe the solution set of two equations or inequalities joined.

Chapter 1 Section 1.2 Symbolic Logic. Sentences vs Statements A truth value is one of two words either true (T) or false (F). A statement is a particular.

2.2 Statements, Connectives, and Quantifiers

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.1 Logic Statements.

© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Objectives 1. Statements, quantifiers, and compound statements 2. Statements involving the words not,

Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.

Conjunction A conjunction is a compound statement formed by combining two simple sentences using the word “AND”. A conjunction is only true when both.

Logic. Statements, Connectives, and Quantifiers In symbolic logic, we only care whether statements are true or false – not their content. In logic, a.

Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.1, Slide Logic The Study of What’s True or False or Somewhere in Between.

Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.1, Slide Logic The Study of What’s True or False or Somewhere in Between.

MATH 110 Sec 3-1 Lecture on Statements and Connectives STATEMENT: A declarative sentence that is either TRUE or FALSE (but not both at once).

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.

Thinking Mathematically

3.1 Statements and Quantifiers 3.2 Truth Tables.  A statement is a declarative sentence that is either true or false.  Examples: Mr. Healey is my math.

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.

Lecture Predicates and Quantifiers 1.4 Nested Quantifiers.

Logical Operations – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Logical Operations Reading: Kolman, Section 2.1.

 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.

Discrete Structures Predicate Logic 1 Dr. Muhammad Humayoun Assistant Professor COMSATS Institute of Computer Science, Lahore.

CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.

Chapter 3 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.

Thinking Mathematically Statements, Negations, and Quantified Statements.

Unit 2 – Week 5 Reasoning with Linear Equations and Inequalities Lesson 3 Students describe the solution set of two equations or inequalities joined by.

Logic Terminology Statement- declarative sentence that is either true or false Opinion- a belief about matters commonly considered to be subjective,

3.3 – The Conditional A conditional statement is a compound statement that uses the connective if…then. The conditional is written with an arrow, so “if.

Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.

 Statement - sentence that can be proven true or false  Truth value – true or false  Statements are often represented using letters such as p and q.

CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.

INTRODUCTION TO LOGIC. PURPOSE: – To distinguish good arguments from poor ones Arguments consist of STATEMENTS – A statement is a sentence that can be.

Presented by: Tutorial Services The Math Center

CSNB 143 Discrete Mathematical Structures

CHAPTER 3 Logic.

Chapter 3: Introduction to Logic

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

2.1 Propositions and Logical Operations

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.

Section 3.1 Statements and Logical Connectives

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.

Chapter 1 Logic and Proof.

(1.4) An Introduction to Logic

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.

CHAPTER 3 Logic.

Statements and Logical Connectives

Chapter 3: Selection Structures: Making Decisions

Presentation transcript:

Is this a statement? I am superman. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises

Is this a statement? I am superman. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises STATEMENT A declarative sentence that is either TRUE or FALSE (but not both at once).

Is this a statement? I am superman. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises YES STATEMENT A declarative sentence that is either TRUE or FALSE (but not both at once).

Is this a statement? I am superman. Hold this for me. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises YES STATEMENT A declarative sentence that is either TRUE or FALSE (but not both at once).

Is this a statement? I am superman. Hold this for me. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises YES This is a command or request but not a statement that can be judged either true or false. STATEMENT A declarative sentence that is either TRUE or FALSE (but not both at once).

Is this a statement? I am superman. Hold this for me. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises YES This is a command or request but not a statement that can be judged either true or false. STATEMENT A declarative sentence that is either TRUE or FALSE (but not both at once). NO

I am superman. Hold this for me. What do you want to eat? MATH 110 Sec 3-1: Statements and Connectives Practice Exercises YES This is a command or request but not a statement that can be judged either true or false. STATEMENT A declarative sentence that is either TRUE or FALSE (but not both at once). NO Is this a statement?

I am superman. Hold this for me. What do you want to eat? MATH 110 Sec 3-1: Statements and Connectives Practice Exercises YES This is a command or request but not a statement that can be judged either true or false. STATEMENT A declarative sentence that is either TRUE or FALSE (but not both at once). NO Is this a statement? This is a question, not a statement that can be judged either true or false.

I am superman. Hold this for me. What do you want to eat? MATH 110 Sec 3-1: Statements and Connectives Practice Exercises YES This is a command or request but not a statement that can be judged either true or false. STATEMENT A declarative sentence that is either TRUE or FALSE (but not both at once). NO Is this a statement? This is a question, not a statement that can be judged either true or false. NO

Is this statement simple or compound? I am superman. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises

Is this statement simple or compound? I am superman. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises COMPOUND STATEMENTS are formed by 'combining' simple statements using various connectives ('and', 'or', 'not', 'if...then', etc.).

Is this statement simple or compound? I am superman. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises COMPOUND STATEMENTS are formed by 'combining' simple statements using various connectives ('and', 'or', 'not', 'if...then', etc.). SIMPLE

Is this statement simple or compound? I am superman. I will go to work and Alice will stay here. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises COMPOUND STATEMENTS are formed by 'combining' simple statements using various connectives ('and', 'or', 'not', 'if...then', etc.). SIMPLE

Is this statement simple or compound? I am superman. I will go to work and Alice will stay here. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises COMPOUND STATEMENTS are formed by 'combining' simple statements using various connectives ('and', 'or', 'not', 'if...then', etc.). SIMPLE

Is this statement simple or compound? I am superman. I will go to work and Alice will stay here. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises COMPOUND STATEMENTS are formed by 'combining' simple statements using various connectives ('and', 'or', 'not', 'if...then', etc.). SIMPLE (2 simple statements joined by a connective)

Is this statement simple or compound? I am superman. I will go to work and Alice will stay here. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises COMPOUND STATEMENTS are formed by 'combining' simple statements using various connectives ('and', 'or', 'not', 'if...then', etc.). SIMPLE (2 simple statements joined by a connective) COMPOUND

Is this statement simple or compound? I am superman. I will go to work and Alice will stay here. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises COMPOUND STATEMENTS are formed by 'combining' simple statements using various connectives ('and', 'or', 'not', 'if...then', etc.). SIMPLE COMPOUND (2 simple statements joined by a connective) For the compound statement, what connective(s) are being used?

Is this statement simple or compound? I am superman. I will go to work and Alice will stay here. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises COMPOUND STATEMENTS are formed by 'combining' simple statements using various connectives ('and', 'or', 'not', 'if...then', etc.). SIMPLE COMPOUND (2 simple statements joined by a connective) For the compound statement, what connective(s) are being used? Connectives and or (inclusive) not If…then If and only if

Is this statement simple or compound? I am superman. I will go to work and Alice will stay here. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises COMPOUND STATEMENTS are formed by 'combining' simple statements using various connectives ('and', 'or', 'not', 'if...then', etc.). SIMPLE COMPOUND (2 simple statements joined by a connective) For the compound statement, what connective(s) are being used? and Connectives and or (inclusive) not If…then If and only if

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises Is this statement simple or compound? If you have poor vision and you take certain medications, you are prohibited from operating motor vehicles.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises COMPOUND Is this statement simple or compound? If you have poor vision and you take certain medications, you are prohibited from operating motor vehicles.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises What connective(s) are being used? COMPOUND

Is this statement simple or compound? If you have poor vision and you take certain medications, you are prohibited from operating motor vehicles. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises What connective(s) are being used? COMPOUND Connectives and or (inclusive) not If…then If and only if

Is this statement simple or compound? If you have poor vision and you take certain medications, you are prohibited from operating motor vehicles. And MATH 110 Sec 3-1: Statements and Connectives Practice Exercises What connective(s) are being used? COMPOUND Connectives and or (inclusive) not If…then If and only if

Is this statement simple or compound? If you have poor vision and you take certain medications, you are prohibited from operating motor vehicles. And If…then MATH 110 Sec 3-1: Statements and Connectives Practice Exercises What connective(s) are being used? COMPOUND (then) Connectives and or (inclusive) not If…then If and only if

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises If p stands for ‘This meal is delicious’ and q stands for ‘Busy people do not eat’, write the following in symbolic form. The meal is delicious and the meal is not delicious.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises If p stands for ‘This meal is delicious’ and q stands for ‘Busy people do not eat’, write the following in symbolic form. The meal is delicious and the meal is not delicious.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises If p stands for ‘This meal is delicious’ and q stands for ‘Busy people do not eat’, write the following in symbolic form. The meal is delicious and the meal is not delicious. p

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises If p stands for ‘This meal is delicious’ and q stands for ‘Busy people do not eat’, write the following in symbolic form. The meal is delicious and the meal is not delicious.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises If p stands for ‘This meal is delicious’ and q stands for ‘Busy people do not eat’, write the following in symbolic form. The meal is delicious and the meal is not delicious.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises If p stands for ‘This meal is delicious’ and q stands for ‘Busy people do not eat’, write the following in symbolic form. The meal is delicious and the meal is not delicious.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises If p stands for ‘This meal is delicious’ and q stands for ‘Busy people do not eat’, write the following in symbolic form. The meal is delicious and the meal is not delicious.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises If p stands for ‘This meal is delicious’ and q stands for ‘Busy people do not eat’, write the following in symbolic form. The meal is delicious and the meal is not delicious. It is false that both the meal is delicious and busy people do not eat.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises If p stands for ‘This meal is delicious’ and q stands for ‘Busy people do not eat’, write the following in symbolic form. The meal is delicious and the meal is not delicious. It is false that both the meal is delicious and busy people do not eat.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises If p stands for ‘This meal is delicious’ and q stands for ‘Busy people do not eat’, write the following in symbolic form. The meal is delicious and the meal is not delicious. It is false that both the meal is delicious and busy people do not eat.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises If p stands for ‘This meal is delicious’ and q stands for ‘Busy people do not eat’, write the following in symbolic form. The meal is delicious and the meal is not delicious. It is false that both the meal is delicious and busy people do not eat.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises If p stands for ‘This meal is delicious’ and q stands for ‘Busy people do not eat’, write the following in symbolic form. The meal is delicious and the meal is not delicious. It is false that both the meal is delicious and busy people do not eat.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises If p stands for ‘This meal is delicious’ and q stands for ‘Busy people do not eat’, write the following in symbolic form. The meal is delicious and the meal is not delicious. It is false that both the meal is delicious and busy people do not eat.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises Negate the quantified statement and then rewrite it in English in an alternative way. All parrots fly.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises Negate the quantified statement and then rewrite it in English in an alternative way. All parrots fly. The negation is: a.Some parrots fly. b.All parrots do not fly. c.There exists at least one parrot that flies. d.There exists at least one parrot that does not fly.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises Negate the quantified statement and then rewrite it in English in an alternative way. All parrots fly. The negation is: a.Some parrots fly. b.All parrots do not fly. c.There exists at least one parrot that flies. d.There exists at least one parrot that does not fly. Hint: The negation of a Universal statement will be an Existential statement AND the negation of an Existential statement will be a Universal statement. Sometimes we are asked to find the negation of a statement with a universal or an existential quantifier. Universal quantifiers ‘All’, ‘Each’, ‘Every’, ‘No’, ‘None’ Existential quantifiers ‘Some’, ‘There exists’, ‘At least one’

Hint: The negation of a Universal statement will be an Existential statement AND the negation of an Existential statement will be a Universal statement. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises Negate the quantified statement and then rewrite it in English in an alternative way. All parrots fly. The negation is: a.Some parrots fly. b.All parrots do not fly. c.There exists at least one parrot that flies. d.There exists at least one parrot that does not fly. Sometimes we are asked to find the negation of a statement with a universal or an existential quantifier. Universal quantifiers ‘All’, ‘Each’, ‘Every’, ‘No’, ‘None’ Existential quantifiers ‘Some’, ‘There exists’, ‘At least one’

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises Negate the quantified statement and then rewrite it in English in an alternative way. All parrots fly. The negation is: a.Some parrots fly. b.All parrots do not fly. c.There exists at least one parrot that flies. d.There exists at least one parrot that does not fly. Sometimes we are asked to find the negation of a statement with a universal or an existential quantifier. Hint: The negation of a Universal statement will be an Existential statement AND the negation of an Existential statement will be a Universal statement. Universal quantifiers ‘All’, ‘Each’, ‘Every’, ‘No’, ‘None’ Existential quantifiers ‘Some’, ‘There exists’, ‘At least one’

All parrots fly. MATH 110 Sec 3-1: Statements and Connectives Practice Exercises Negate the quantified statement and then rewrite it in English in an alternative way. The negation is: a.Some parrots fly. b.All parrots do not fly. c.There exists at least one parrot that flies. d.There exists at least one parrot that does not fly. Sometimes we are asked to find the negation of a statement with a universal or an existential quantifier. Hint: The negation of a Universal statement will be an Existential statement AND the negation of an Existential statement will be a Universal statement. Universal quantifiers ‘All’, ‘Each’, ‘Every’, ‘No’, ‘None’ Existential quantifiers ‘Some’, ‘There exists’, ‘At least one’

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises Negate the quantified statement and then rewrite it in English in an alternative way. All parrots fly. The negation is: a.Some parrots fly. b.All parrots do not fly. c.There exists at least one parrot that flies. d.There exists at least one parrot that does not fly. Sometimes we are asked to find the negation of a statement with a universal or an existential quantifier. Hint: The negation of a Universal statement will be an Existential statement AND the negation of an Existential statement will be a Universal statement. Universal quantifiers ‘All’, ‘Each’, ‘Every’, ‘No’, ‘None’ Existential quantifiers ‘Some’, ‘There exists’, ‘At least one’

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises Negate the quantified statement and then rewrite it in English in an alternative way. All parrots fly. The negation is: a.Some parrots fly. b.All parrots do not fly. c.There exists at least one parrot that flies. d.There exists at least one parrot that does not fly. Sometimes we are asked to find the negation of a statement with a universal or an existential quantifier. Hint: The negation of a Universal statement will be an Existential statement AND the negation of an Existential statement will be a Universal statement. Universal quantifiers ‘All’, ‘Each’, ‘Every’, ‘No’, ‘None’ Existential quantifiers ‘Some’, ‘There exists’, ‘At least one’ negate

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises Negate the quantified statement and then rewrite it in English in an alternative way. All parrots fly. The negation is: a.Some parrots fly. b.All parrots do not fly. c.There exists at least one parrot that flies. d.There exists at least one parrot that does not fly. Sometimes we are asked to find the negation of a statement with a universal or an existential quantifier. Hint: The negation of a Universal statement will be an Existential statement AND the negation of an Existential statement will be a Universal statement. Universal quantifiers ‘All’, ‘Each’, ‘Every’, ‘No’, ‘None’ Existential quantifiers ‘Some’, ‘There exists’, ‘At least one’ negate

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises Negate the quantified statement and then rewrite it in English in an alternative way. Some lions do not have claws.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises Negate the quantified statement and then rewrite it in English in an alternative way. The negation is: a.No lions have claws. b.All lions have claws. c.There exists at least one lion that has claws. d.There exists at least one lion that does not have claws. Some lions do not have claws.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises Negate the quantified statement and then rewrite it in English in an alternative way. Some lions do not have claws. The negation is: a.No lions have claws. b.All lions have claws. c.There exists at least one lion that has claws. d.There exists at least one lion that does not have claws. Hint: The negation of a Universal statement will be an Existential statement AND the negation of an Existential statement will be a Universal statement. Sometimes we are asked to find the negation of a statement with a universal or an existential quantifier. Universal quantifiers ‘All’, ‘Each’, ‘Every’, ‘No’, ‘None’ Existential quantifiers ‘Some’, ‘There exists’, ‘At least one’

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises Negate the quantified statement and then rewrite it in English in an alternative way. Some lions do not have claws. The negation is: a.No lions have claws. b.All lions have claws. c.There exists at least one lion that has claws. d.There exists at least one lion that does not have claws. Hint: The negation of a Universal statement will be an Existential statement AND the negation of an Existential statement will be a Universal statement. Sometimes we are asked to find the negation of a statement with a universal or an existential quantifier. Universal quantifiers ‘All’, ‘Each’, ‘Every’, ‘No’, ‘None’ Existential quantifiers ‘Some’, ‘There exists’, ‘At least one’

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises Negate the quantified statement and then rewrite it in English in an alternative way. Some lions do not have claws. The negation is: a.No lions have claws. b.All lions have claws. c.There exists at least one lion that has claws. d.There exists at least one lion that does not have claws. Hint: The negation of a Universal statement will be an Existential statement AND the negation of an Existential statement will be a Universal statement. Sometimes we are asked to find the negation of a statement with a universal or an existential quantifier. Universal quantifiers ‘All’, ‘Each’, ‘Every’, ‘No’, ‘None’ Existential quantifiers ‘Some’, ‘There exists’, ‘At least one’

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises Negate the quantified statement and then rewrite it in English in an alternative way. Some lions do not have claws. The negation is: a.No lions have claws. b.All lions have claws. c.There exists at least one lion that has claws. d.There exists at least one lion that does not have claws. Hint: The negation of a Universal statement will be an Existential statement AND the negation of an Existential statement will be a Universal statement. Sometimes we are asked to find the negation of a statement with a universal or an existential quantifier. Universal quantifiers ‘All’, ‘Each’, ‘Every’, ‘No’, ‘None’ Existential quantifiers ‘Some’, ‘There exists’, ‘At least one’

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises Negate the quantified statement and then rewrite it in English in an alternative way. Some lions do not have claws. The negation is: a.No lions have claws. b.All lions have claws. c.There exists at least one lion that has claws. d.There exists at least one lion that does not have claws. Hint: The negation of a Universal statement will be an Existential statement AND the negation of an Existential statement will be a Universal statement. Sometimes we are asked to find the negation of a statement with a universal or an existential quantifier. Universal quantifiers ‘All’, ‘Each’, ‘Every’, ‘No’, ‘None’ Existential quantifiers ‘Some’, ‘There exists’, ‘At least one’ negate

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises Negate the quantified statement and then rewrite it in English in an alternative way. Some lions do not have claws. The negation is: a.No lions have claws. b.All lions have claws. c.There exists at least one lion that has claws. d.There exists at least one lion that does not have claws. Hint: The negation of a Universal statement will be an Existential statement AND the negation of an Existential statement will be a Universal statement. Sometimes we are asked to find the negation of a statement with a universal or an existential quantifier. Universal quantifiers ‘All’, ‘Each’, ‘Every’, ‘No’, ‘None’ Existential quantifiers ‘Some’, ‘There exists’, ‘At least one’ negate

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises NameYear ScholarshipAthleteCommuter TitoFreshmanYes No JonFreshmanYes No OmarosaSophomoreYes No LennoxJuniorYes No StephenSophomoreYes NadiaSophomoreNo Yes PiersFreshmanNoYesNo Use the tabled information to determine whether the given statement is true or false and, if false, why. TRUE or FALSE All sophomores are commuters.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises NameYear ScholarshipAthleteCommuter TitoFreshmanYes No JonFreshmanYes No OmarosaSophomoreYes No LennoxJuniorYes No StephenSophomoreYes NadiaSophomoreNo Yes PiersFreshmanNoYesNo Use the tabled information to determine whether the given statement is true or false and, if false, why. TRUE or FALSE All sophomores are commuters.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises NameYear ScholarshipAthleteCommuter TitoFreshmanYes No JonFreshmanYes No OmarosaSophomoreYes No LennoxJuniorYes No StephenSophomoreYes NadiaSophomoreNo Yes PiersFreshmanNoYesNo Use the tabled information to determine whether the given statement is true or false and, if false, why. TRUE or FALSE All sophomores are commuters.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises NameYear ScholarshipAthleteCommuter TitoFreshmanYes No JonFreshmanYes No OmarosaSophomoreYes No LennoxJuniorYes No StephenSophomoreYes NadiaSophomoreNo Yes PiersFreshmanNoYesNo Use the tabled information to determine whether the given statement is true or false and, if false, why. TRUE or FALSE All sophomores are commuters. Omarosa is a sophomore but not a commuter.

MATH 110 Sec 3-1: Statements and Connectives Practice Exercises NameYear ScholarshipAthleteCommuter TitoFreshmanYes No JonFreshmanYes No OmarosaSophomoreYes No LennoxJuniorYes No StephenSophomoreYes NadiaSophomoreNo Yes PiersFreshmanNoYesNo Use the tabled information to determine whether the given statement is true or false and, if false, why. TRUE or FALSE All sophomores are commuters. FALSE