Statements and Logical Connectives

Slides:



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

04 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Goals Determine the true value of statements with AND, OR, IF..THEN. Negate statements with the connectives above Construct truth tables Understand when.
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.
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.
SEVENTH EDITION and EXPANDED SEVENTH EDITION
The Language of Propositional Logic The Syntax and Semantics of PL.
Predicates and Quantifiers
Propositions and Truth Tables
Discrete Mathematics and Its Applications
Chapter 2 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
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.
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.
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).
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.
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
Chapter 3 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Thinking Mathematically Statements, Negations, and Quantified Statements.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.
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.
 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.
CS104 The Foundations: Logic and Proof 1. 2 What is Discrete Structure?  Discrete Objects  Separated from each other (Opposite of continuous)  e.g.,
INTRODUCTION TO LOGIC. PURPOSE: – To distinguish good arguments from poor ones Arguments consist of STATEMENTS – A statement is a sentence that can be.
Truth Tables for Negation, Conjunction, and Disjunction
Presented by: Tutorial Services The Math Center
2. The Logic of Compound Statements Summary
AND.
CSNB 143 Discrete Mathematical Structures
Truth Tables and Equivalent Statements
CHAPTER 3 Logic.
Truth Tables for Negation, Conjunction, and Disjunction
Chapter 3: Introduction to Logic
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Truth Tables – Logic (Continued)
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 8 Logic Topics
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.
TRUTH TABLES.
Chapter 1 Logic and Proof.
(1.4) An Introduction to Logic
Discrete Mathematics and Its Applications Kenneth H
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture 2: Propositional Logic
MAT 3100 Introduction to Proof
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Discrete Mathematics Lecture 2: Propositional Logic
Statements of Symbolic Logic
CHAPTER 3 Logic.
Introductory Logic PHI 120
CHAPTER 3 Logic.
Section 3.3 Truth Tables for the Conditional and Biconditional
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
Truth Tables for the Conditional and Biconditional
8A, 8B Propositions Unit 7: Logic and Sets 8A, 8B 6/1/ :59 AM.
2-2 Logic Vocab Statement: A sentence that is either true or false
CHAPTER 3 Logic.
Truth Tables for Conditional and Biconditional Statements
boolean Expressions Relational, Equality, and Logical Operators
Presentation transcript:

Statements and Logical Connectives 3.1 Statements and Logical Connectives

Logic and the English Language Connectives - words such as and, or, if, then Exclusive or - one or the other of the given events can happen, but not both. Inclusive or - one or the other or both of the given events can happen.

Statements and Logical Connectives Statement - A sentence that can be judged either true or false. Labeling a statement true or false is called assigning a truth value to the statement. Simple Statements - A sentence that conveys only one idea. Compound Statements - Sentences that combine two or more ideas and can be assigned a truth value.

Quantifiers Negation of a statement - change a statement to its opposite meaning. The negation of a false statement is always a true statement. The negation of a true statement is always a false statement. Quantifiers - words such as all, none, no, some, etc… Be careful when negating statements that contain quantifiers.

Negation of Quantified Statements Form of statement All are. None are. Some are. Some are not. Form of negation Some are not. Some are. None are. All are. None are. Some are not. All are. Some are.

Example: Write Negations Write the negation of the statement. Some candy bars contain nuts. Solution: Since some means “at least one” this statement is true. The negation is “No candy bars contain nuts,” which is a false statement.

Example: Write Negations continued Write the negation of the statement. All tables are oval. Solution: This is a false statement since some tables are round, rectangular, or other shapes. The negation would be “Some tables are not oval.”

Compound Statements Statements consisting of two or more simple statements are called compound statements. The connectives often used to join two simple statements are and, or, if…then…, and if and only if.

Not Statements The symbol used in logic to show the negation of a statement is ~. It is read “not”.

And Statements is the symbol for a conjunction and is read “and.” The other words that may be used to express a conjunction are: but, however, and nevertheless.

Example: Write a Conjunction Write the conjunction in symbolic form. The dog is gray, but the dog is not old. Solution: Let p and q represent the simple statements. p: The dog is gray. q: The dog is old. In symbol form, the compound statement is p ^ ~ q

Or Statements: The disjunction is symbolized by and read “or.” In this book the “or” will be the inclusive or, (except where indicated in the exercise set).

Example: Write a Disjunction Write the statement in symbolic form. Carl will not go to the movies or Carl will not go to the baseball game. Solution: Let p and q represent the simple statements. p: Carl will go to the movies. q: Carl will go to a baseball game. In symbol form, the compound statement is

If-Then Statements The conditional is symbolized by and is read “if-then.” The antecedent is the part of the statement that comes before the arrow. The consequent is the part that follows the arrow.

Example: Write a Conditional Statement Let p: Nathan goes to the park. q: Nathan will swing. Write the following statements symbolically. a. If Nathan goes to the park, then he will swing. b. If Nathan does not go to the park, then he will not swing. Solutionsa) b)

If and Only If Statements The biconditional is symbolized by and is read “if and only if.” If and only if is sometimes abbreviated as “iff.”

Example: Write a Statement Using the Biconditional Let p: The dryer is running. q: There are clothes in the dryer. Write the following symbolic statements in words. a) b) Solutions: a. The clothes are in the dryer if and only if the dryer is running. b. It is false that the dryer is running if and only if the clothes are not in the dryer.

Homework P. 101 # 1 – 8, 10-82 evens