Valid Arguments Decide if each argument is valid. If the stones are rolling, they are not gathering moss. If the stones are not gathering moss, they are.

Slides:



Advertisements
Similar presentations
Introduction to Proofs
Advertisements

Conditional Statements
Discrete Mathematics I Lectures Chapter 6
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Elementary Number Theory and Methods of Proof
Notes on Logic Continued
Conditional Statements
1 Discrete Structures CS Johnnie Baker Comments on Early Term Test.
Discrete Mathematics Lecture 2 Alexander Bukharovich New York University.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
CMSC 250 Discrete Structures Exam #1 Review. 21 June 2007Exam #1 Review2 Symbols & Definitions for Compound Statements pq p  qp  qp  qp  qp  q 11.
Chapter 2 The Basic Concepts of Set Theory
Mathematical Induction Assume that we are given an infinite supply of stamps of two different denominations, 3 cents and and 5 cents. Prove using mathematical.
Adapted from Discrete Math
Predicates and Quantifiers
This section will discuss the symbolism and concepts of set theory
Algebraic Structures: An Activities Based Course MATH 276 UWM MATH 276 UWM.
Section 1.1 Numbers and Their Properties.
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.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
 Predicate: A sentence that contains a finite number of variables and becomes a statement when values are substituted for the variables. ◦ Domain: the.
Review I Rosen , 3.1 Know your definitions!
CS 173, Lecture B August 27, 2015 Tandy Warnow. Proofs You want to prove that some statement A is true. You can try to prove it directly, or you can prove.
Homework Review notes Complete Worksheet #1. Homework Let A = {a,b,c,d}, B = {a,b,c,d,e}, C = {a,d}, D = {b, c} Describe any subset relationships. 1.
Chapter 1 Logic Section 1-1 Statements Open your book to page 1 and read the section titled “To the Student” Now turn to page 3 where we will read the.
Mathematical Preliminaries (Hein 1.1 and 1.2) Sets are collections in which order of elements and duplication of elements do not matter. – {1,a,1,1} =
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
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.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.
1 Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 2: Logic & Incidence Geometry Back To the Very Basic Fundamentals.
DISCRETE COMPUTATIONAL STRUCTURES
Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems or solving problems, creativity and insight.
CS201: Data Structures and Discrete Mathematics I
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
Section 2-2: Conditional Statements. Conditional A statement that can be written in If-then form symbol: If p —>, then q.
Section 2.1. Section Summary Definition of sets Describing Sets Roster Method Set-Builder Notation Some Important Sets in Mathematics Empty Set and Universal.
EOC Practice #9 SPI
ELEMENTARY SET THEORY.
Venn Diagrams Truth Sets & Valid Arguments Truth Sets & Valid Arguments Truth Tables Implications Truth Tables Implications Truth Tables Converse, Inverse,
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.
Chapter 2 Symbolic Logic. Section 2-1 Truth, Equivalence and Implication.
Chapter 2 With Question/Answer Animations. Section 2.1.
Chapter 2 Fundamentals of Logic 1. What is a valid argument or proof?
CS104:Discrete Structures Chapter 2: Proof Techniques.
Week 4 - Friday.  What did we talk about last time?  Floor and ceiling  Proof by contradiction.
Number Sets. Symbols for Number Set Counting numbers ( maybe 0, 1, 2, 3, 4, and so on) Natural Numbers: Positive and negative counting numbers (-2, -1,
1 Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 2: Logic & Incidence Geometry Back To the Very Basic Fundamentals.
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.
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Discrete Mathematics Margaret H. Dunham
Introduction to Deductive Proofs
2. The Logic of Compound Statements Summary
3. The Logic of Quantified Statements Summary
Chapter 1 Logic and Proofs Homework 2 Given the statement “A valid password is necessary for you to log on to the campus server.” Express the statement.
Y. Davis Geometry Notes Chapter 2.
Chapter 8 Logic Topics
2 Chapter Introduction to Logic and Sets
Sets and Logic…. Chapter 3
CHAPTER 1: LOGICS AND PROOF
A Brief Summary for Exam 1
CS 220: Discrete Structures and their Applications
Discrete Mathematics Lecture 4 Logic of Quantified Statements
Lesson 3.1 Real Numbers pp
Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.
Presentation transcript:

Valid Arguments Decide if each argument is valid. If the stones are rolling, they are not gathering moss. If the stones are not gathering moss, they are a smooth group of rocks. Therefore, if the stones are rolling, they are a smooth rock group. If a penny has an Indian head on it, it is very old. If a penny has an Indian head on it, it is worth more than one cent. Therefore, if a penny is very old, it is worth more than one cent.

Valid Arguments, continued If your name is in Who’s Who, then you know what’s what. If you are not sure of where’s where, then you don’t know what’s what. If your name is in Who’s Who, then you are sure of where’s where.

 Statement - A sentence which is either true or false.  and: p and q, p  q  or: p or q, p  q  implies (conditional statement, if p, then q): p  q  if and only if (biconditional statement, p iff q), p  q, equivalent to p  q and q  p.  not p, the negation of p, ~ p Logic

Combining Statements  Conditional Statement: if p then q, p  q  Converse of a conditional statement: if q, then p, q  p  Contrapositive of conditional: if not q, then not p, ~ q  ~ p  Inverse of conditional: if not p, then not q, ~ p  ~ q

Constructing Truth Tables A truth table tells exactly under what circumstances a statement is true and a statement is false. All true-false combinations must be considered, 2 n combinations. Equivalent statements are statements that are true at the same time and false at the same time. If p is true,  p is false.

Equivalent Statements p  q is equivalent to p  q  q  p. ~ ( p  q )  (~ p )  ( ~ q ) Activity 1.7 ~ ( p  q )  (~ p )  ( ~ q ) Activity 1.8 ( p  q )  r  p  ( q  r ) (1.9) Parentheses are needed! ( p  q )  r  p  ( q  r ) (1.10) What property does this look like? p  ( q  r )  ? (1.12) p  ( q  r )  ? What property does this look like? p  ( q  r )  p  ~ q  r (1.14)

Logic of a 5th Grader = n%3fsource=search_video = n%3fsource=search_video

Open Sentences and Quantifiers An open sentence contains one or more variables and becomes a statement when the variable is replaced.  is a universal quantifier which means: for every or for all.  (x), P(x)… is read: For all x, P(x).  is an existential quantifier which means: there exists, for some, for at least one.  (x), P(x)… is read: There exists an x such that P(x).

How many teachers are there? King Middle School has 1200 students. Each student takes 6 classes in a day. Each class has 30 students and one teacher. Every teacher teaches five classes and has one planning period in a day. Each period there are 40 classes. Every student has to take a class during each of the six periods.

Rational and Irrational Numbers The need for multiplicative inverses and rational numbers The need for irrational numbers Prove √ 2 is an irrational number. (Pg. 159) Real Numbers - Filling the holes on the number line Complex Numbers - Solution for x = 0 √-1 = i, a + bi, where a,b  R

Symbols for Sets of Numbers Natural, Counting Numbers N + Whole Numbers IntegersZ Rational Numbers (a/b, b≠0, a,b  Z) Q Positive Rational NumbersQ + Real Numbers (real number line) R Positive Real NumbersR + Complex Numbers (a + bi, a,b  R) C

Proof by Contradiction You are taking a true-false quiz with 5 questions. From past experience you know: If the first answer is true, the next one is false. The last answer is always the same as the first answer. You are positive the second answer is true. On the assumption that these statements are correct, prove that the last answer is false.

Describing Sets Roster: {...-4, -2, 0, 2, 4, 6...} Set Builder Notation: {x  P(x) = 2x, x  Z} Words: {x  x is an even integer}

Sets - Symbols and Definitions A  B; A is a subset of B. A = B; A equals B { }, Ø; Empty Set A  B; {x  x  A or x  B} A  B; {x  x  A and x  B} B; Complement of B A - B; Complement of B in A, {x  x  A and x  B} A  B; Symmetric Difference, (A - B)  (B - A) A  B; Cartesian Product; {(a, b)  a  A and B  B} n(A) n(B) = n(A  B)

Theorems about Sets Draw Venn Diagrams to justify DeMorgan’s Laws A – (B  C) = (A – B)  (A – C) A – (B  C) = (A – B)  (A – C)

Using the Graphing Calculator Rule ( X KEY, Y = ) Table ( TBLSET, TABLE ) Graph ( WINDOW, TRACE, MODE, FORMAT )