Survey of Mathematical Ideas Math 100 Chapter 3, Logic

Slides:



Advertisements
Similar presentations
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Advertisements

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 1: (Part 2): The Foundations: Logic and Proofs.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Elementary Number Theory and Methods of Proof
John Rosson Thursday February 15, 2007 Survey of Mathematical Ideas Math 100 Chapter 3, Logic.
Discrete Mathematics Lecture 2 Alexander Bukharovich New York University.
1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.
Copyright © Cengage Learning. All rights reserved.
Discrete Structures Chapter 3: The Logic of Quantified Statements
Statements and Quantifiers
Survey of Mathematical Ideas Math 100 Chapter 2 John Rosson Thursday January 25, 2007.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Adapted from Discrete Math
Predicates and Quantifiers
What is logic? Logic is the science of how to evaluate arguments and reasoning. Critical thinking is a process of evaluation which uses logic to separate.
Methods of Proof & Proof Strategies
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.
Chapter 3 – Introduction to Logic
Chap. 2 Fundamentals of Logic. Proposition Proposition (or statement): an declarative sentence that is either true or false, but not both. e.g. –Margret.
Fall 2002CMSC Discrete Structures1 Let’s get started with... Logic !
2.2 Statements, Connectives, and Quantifiers
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
2.3Logical Implication: Rules of Inference From the notion of a valid argument, we begin a formal study of what we shall mean by an argument and when such.
Copyright © Cengage Learning. All rights reserved. CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS THE LOGIC OF QUANTIFIED STATEMENTS.
January 30, 2002Applied Discrete Mathematics Week 1: Logic and Sets 1 Let’s Talk About Logic Logic is a system based on propositions.Logic is a system.
CompSci 102 Discrete Math for Computer Science
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.
Predicates and Quantified Statements
Section 2.1. Section Summary Definition of sets Describing Sets Roster Method Set-Builder Notation Some Important Sets in Mathematics Empty Set and Universal.
Chapter 2 The Logic of Quantified Statements. Section 2.1 Intro to Predicates & Quantified Statements.
Thinking Mathematically
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.
1 Introduction to Abstract Mathematics Predicate Logic Instructor: Hayk Melikya Purpose of Section: To introduce predicate logic (or.
Lecture 7 – Jan 28, Chapter 2 The Logic of Quantified Statements.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
Chapter 2 Symbolic Logic. Section 2-1 Truth, Equivalence and Implication.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Chapter 2 With Question/Answer Animations. Section 2.1.
Section 1.5 and 1.6 Predicates and Quantifiers. Vocabulary Predicate Domain Universal Quantifier Existential Quantifier Counterexample Free variable Bound.
1 Introduction to Abstract Mathematics Chapter 3: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 3.1.
Section 2.1. Sets A set is an unordered collection of objects. the students in this class the chairs in this room The objects in a set are called the.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
1 Section 7.1 First-Order Predicate Calculus Predicate calculus studies the internal structure of sentences where subjects are applied to predicates existentially.
Introduction to Logic © 2008 Pearson Addison-Wesley.
3. The Logic of Quantified Statements Summary
DISCRETE MATHEMATICS CHAPTER I.
CSNB 143 Discrete Mathematical Structures
Chapter 3: Introduction to Logic
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
2.1 Propositions and Logical Operations
CMSC Discrete Structures
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
CHAPTER 1: LOGICS AND PROOF
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
(1.4) An Introduction to Logic
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture 3: Predicate and Quantifier
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Copyright © Cengage Learning. All rights reserved.
Predicates and Quantifiers
Discrete Mathematics Lecture 4 Logic of Quantified Statements
Copyright © Cengage Learning. All rights reserved.
Algebra 1 Section 4.1.
Presentation transcript:

Survey of Mathematical Ideas Math 100 Chapter 3, Logic John Rosson Thursday February 8, 2007

Introduction to Logic Statements and Quantifiers Truth Tables and Equivalent Statements The Conditional More on the Conditional Analyzing Arguments Truth Tables

Statements A statement is a declarative sentence that is either true or false but not both. Such a sentence is said to have a truth value of either true or false (but not both). Examples of statements. What are their truth values? Millersville University is in Millersville PA. 2+2=4 2+2=3 {a,b,c}  {a,b} 240 =1099511627776 240 =1099511627775

Statements Examples of nonstatements. 2+2 x+2=3 Logic is an interesting subject. Students ought to study. This sentence is false. Your professor always lies.

Statements Simple statements can be combined into compound statements using logical connectives such as and, or, not, if…then. Examples of compound statements. What are their truth values? Millersville University is in Millersville PA and 2+2=3. Millersville University is in Millersville PA or 2+2=3. If x=1 then x+2=3. If xx then 2+2=3.

Negations The negation of a statement is indicated by words and phrases like not, it is not the case that, it is not true that, does not etc. For mathematical relations negation often indicated by a slash (/) through the relation. Examples of statements. What are their truth values? Millersville University is not in Millersville PA. It is not the case that Millersville University is not in Millersville PA. 2+24 2+23 {a,b,c}  {a,b} /

x is a university in Millersville PA. Quantifiers Sentences that contain variables are usually not statements because the truth value depends on the value assigned the variable. These sentences are indeterminate or predicates. x  x x = x x is a university in Millersville PA. x+3=4 x  {1,2,3,….} x+23 Examples of indeterminate sentences. Give a value making the sentence true and one making it false. Examples of statements. What are their truth values?

Quantifiers Quantifiers are logical elements that give truth values to indeterminate sentences. Universal quantifiers are words like all, each, every and none. Existential quantifiers are words and phrases like some, there exists and (for) at least one. All universities are in Millersville PA. Some universities are in Millersville PA. No universities are in Millersville PA. For at least one value of x, x+3=4. For all values of x, x  {1,2,3,….}. For some values of x, x+23 Examples of quantified sentences. Give the truth values.

Existential Quantifier Symbols To simplify work with logic and to bring out relations between logical (or deductive) reasoning and algebraic calculation the logical elements we have been talking about are replaced by symbols. Logical Element Symbol Type statements p, q, r, s,…. Value true or false and Conjunction or Disjunction not  Negation If… then  Conditional For all Universal Quantifier There exists Existential Quantifier

Examples of formalized statements. Symbols Let p=“Millersville University is in Millersville PA” q=“2+2=3” Examples of formalized statements. Statement In symbols Millersville University is in Millersville PA p Millersville University is not in Millersville PA. p Millersville University is in Millersville PA and 2+2=3. pq Millersville University is in Millersville PA or 2+2=3. pq It is not the case that Millersville University is not in Millersville PA.  p

Examples of formalized statements. Symbols For indeterminate sentences, we indicate the variable in parentheses. Let p(x)=“x is a university in Millersville PA.” q(x)=“x+3=4” r(x)= “x  {1,2,3,….}” Examples of formalized statements. Statement In symbols All universities are in Millersville PA. x p(x) Some universities are in Millersville PA. x p(x) No universities are in Millersville PA. x p(x) For at least one value of x, x+3=4. x q(x) For all values of x, x  {1,2,3,….}. x r(x)

Set Theory Reprise Let us reconsider the definition of the set theory operations using logic symbols.

Symbolic Logic It follows from this symbolization process, some simple logical facts and the fact that everything in mathematics is a set that all statements in mathematics (true or false) can be constructed as lists of the following symbols: x, |, , =, , ,  Here is what “It is not true that for some x, xx” would look like: ~x|~=x|x| In other words, mathematics is a subset of the natural numbers, base 7. Therefore, mathematics itself has cardinality 0. How then can mathematics talk about the the set real numbers, which we have seen has cardinality c > 0? Believe it or not someone actually tried to write out all of mathematics using (essentially) the above seven symbols. The result was the Principia Mathematica of Bertrand Russell and Alfred North Whitehead.

Assignments 3.2, 3.3, 3.4, 3.6 Read Section 3.2 Due February 13 Exercises p. 111 1-20 , 21-25, 45-55. Read Sections 3.3, 3.4 Due February 15 Exercises p. 120 1-18, 55-63 Exercises p. 128 1-16, 19-38. Read Section 3.5, 3.6 Due February 20 Exercises p. 145 1-23 odd, 27,29,47