MATH 245 Spring 2009 This is mathematics for computer science

Slides:



Advertisements
Similar presentations
The Foundation: Logic Conditional Statements Muhammad Arief download dari
Advertisements

Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Discrete Mathematics Math 6A Instructor: M. Welling.
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
CSE115/ENGR160 Discrete Mathematics 01/17/12 Ming-Hsuan Yang UC Merced 1.
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
Propositions and Truth Tables
Discrete Maths 2. Propositional Logic Objective
Discrete Mathematics and Its Applications
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
Chapter 1: The Foundations: Logic and Proofs
Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements
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.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
September1999 CMSC 203 / 0201 Fall 2002 Week #1 – 28/30 August 2002 Prof. Marie desJardins.
1/10/ Math/CSE 1019N: Discrete Mathematics for Computer Science Winter 2007 Suprakash Datta Office: CSEB 3043 Phone:
Propositional Logic ITCS 2175 (Rosen Section 1.1, 1.2)
Chapter 1: The Foundations: Logic and Proofs
Discrete Mathematics Lecture # 4. Conditional Statements or Implication  If p and q are statement variables, the conditional of q by p is “If p then.
Logic and Truth Tables Winter 2012 COMP 1380 Discrete Structures I Computing Science Thompson Rivers University.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
Simple Logic.
Chapter 1 Propositional Logic
Chapter 1 Logic and Proof.
Discrete Mathematical
2. The Logic of Compound Statements Summary
Conditional Statements
Propositional Logic.
2-1 Vocabulary conditional statement hypothesis/conclusion
Discrete Mathematics Lecture 1 Logic of Compound Statements
CSNB 143 Discrete Mathematical Structures
CSCE 235 Introduction to Discrete Structures
Niu Kun Discrete Mathematics Chapter 1 The Foundations: Logic and Proof, Sets, and Functions Niu Kun 离散数学.
COMP 1380 Discrete Structures I Thompson Rivers University
6/20/2018 Arab Open University Faculty of Computer Studies M131 - Discrete Mathematics 6/20/2018.
Logic.
(CSC 102) Discrete Structures Lecture 2.
CPCS222 Discrete Structures I
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I
Mathematics for Computing
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
CSCI 3310 Mathematical Foundation of Computer Science
Administrivia Course Web:
Information Technology Department
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
CS 220: Discrete Structures and their Applications
CHAPTER 1: LOGICS AND PROOF
CS201: Data Structures and Discrete Mathematics I
CSE 311 Foundations of Computing I
Copyright © Cengage Learning. All rights reserved.
CSE 311 Foundations of Computing I
Propositional Logic.
CSE 311 Foundations of Computing I
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I
Discrete Mathematics and Its Applications Kenneth H
Mathematics as a language
Lecture 2: Propositional Equivalences
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
MAT 3100 Introduction to Proof
Cs Discrete Mathematics
COMP 1380 Discrete Structures I Thompson Rivers University
Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.
1.3 Propositional Equivalences
Logic and Reasoning.
Discrete Structures Prepositional Logic 2
Conditional Statements Section 2.3 GEOMETRY
CS201: Data Structures and Discrete Mathematics I
Presentation transcript:

MATH 245 Spring 2009 This is mathematics for computer science Logic and proof Induction and recursion Counting and Probability Course structure Weekly homework Bi-weekly quizes (rewriteable)‏ Final

How to Succeed Read the book Ask questions in class Form study groups Seek help early and often Check web site: http://www.cs.plu.edu/courses/math245/spring2009/

Logic Need formal, careful rules for reasoning Avoid false conclusions Facilitate decision making and design Based in Philosophy first and then Mathematics (all scientists were philosophers then (time of Aristotle))‏

Statement A true or false sentence Good Bad John got an A in Geometry last semester. Crows are birds. Bad John is a religious X + Y = 5 Variables are used to represent a statement: p, q, r, ...

Logic Compound Statements Two or more statements joined by not (~), and (^), or (v)‏ p = It is Monday, q = It is February, r = School is not in session. ~p q ^ r q v ~r

Truth Tables p q p v q t t t t f t f t t f f f p q r p ^ q ~r (p ^ q) v ~r t t t t f t t t f t t t t f t f f f t f f f t t f t t f f f f t f f t t f f t f f t f f f f t t

Logical Equivalence p q p v q q v p t t t t t f t t f t t t f f f f Useful to simplify or otherwise manipulate compound logic statements. E.G. Simplifying boolean conditions in coding

De Morgan's Laws Rules for NOT combined with AND, OR ~( p v q ) == ~p ^ ~q ~( p ^ q ) == ~p v ~q Can use a Truth Table to prove these

Tautologies and Contradictions Tautology – compound statement that is always true: (p v ~p) Contradiction – one that is never true: (p ^ ~p)‏

Conditional Statements The troublesome if ; implication If it rains then ... p -> q ( hypothesis implies conclusion )‏ Truth Table is the troublesome part p q p -> q t t t t f f f t t (weird?) f f t (seems so)‏

Logical Equivalences Operator precedence Show TT for p ^ ~q -> r Show p -> q == ~p v q

Negation of a conditional ~( p -> q ) ?? Since TT is F only when p is T and q is F, ~p ^ q Can also use the above equivalence and De Morgan's Laws NEVER use “if” in the negation of an “if” Negate: if PLU is in Tacoma then it is in Washington

Contrapositive An implication stated with negatives (sort of De Morgans Law again)‏ Contrapositive of p -> q is ~q -> ~p These are equivalent Contrapositive: if PLU is in Tacoma then it is in Washington

Converse and Inverse of p -> q Converse is q -> p Inverse is ~p -> ~q Converse and Inverse: if PLU is in Tacoma then it is in Washington

Only If and Biconditional of p -> q Only If: q only if p Another way to say if p then q Biconditional: p if and only if q (true when p and q are equal)‏

Necessary and Sufficient Conditions Alternate ways of saying if, only if r is a sufficient condition for s if r then s (r -> s) r is a necessary condition for s r iff s ( r <-> s )‏

Logic and English Compound statement sentences need not be related if 2 + 2 = 4 then today is Monday English if usually means iff if you work hard then you will succeed English “or” usually mean exclusive or PLU is in Tacoma or it is in Washington