1/10/2006 1 Math/CSE 1019N: Discrete Mathematics for Computer Science Winter 2007 Suprakash Datta Office: CSEB 3043 Phone: 416-736-2100.

Slides:



Advertisements
Similar presentations
Af2 Introduction. What’s the course about? Discrete Mathematics The mathematics that underpins computer science and other sciences as well.
Advertisements

Grading Lecture attendance: -1% per 2 unexcused absences
1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: The Moon is made of green cheese. Trenton.
CSE 311 Foundations of Computing I Spring 2013 Lecture 1 Propositional Logic.
CSE 311 Foundations of Computing I Autumn 2011 Lecture 1 Propositional Logic.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
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.
CSE115/ENGR160 Discrete Mathematics 01/17/12 Ming-Hsuan Yang UC Merced 1.
Adapted from Discrete Math
3.2 – Truth Tables and Equivalent Statements
The Foundations: Logic and Proofs
1 Math/CSE 1019C: Discrete Mathematics for Computer Science Fall 2011 Suprakash Datta Office: CSEB 3043 Phone: ext
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
Propositions and Truth Tables
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.
Discrete Maths 2. Propositional Logic Objective
CSE 311 Foundations of Computing I Autumn 2012 Lecture 1 Propositional Logic 1.
Discrete Mathematics and Its Applications
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Ch.1 (Part 1): The Foundations: Logic and Proofs Introduction.
CS 285- Discrete Mathematics Lecture 2. Section 1.1 Propositional Logic Propositions Conditional Statements Truth Tables of Compound Propositions Translating.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
Chapter 1: The Foundations: Logic and Proofs
CISC 2315 Discrete Structures Professor William G. Tanner, Jr. Fall 2010 Slides created by James L. Hein, author of Discrete Structures, Logic, and Computability,
Foundations of Computing I CSE 311 Fall CSE 311: Foundations of Computing I Fall 2014 Lecture 1: Propositional Logic.
Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.
CSci 2011 Textbook ^Discrete Mathematics and Its Applications,  Rosen  6th Edition  McGraw Hill  2006.
1 Introduction to Abstract Mathematics The Logic and Language of Proofs Instructor: Hayk Melikya Proposition: Informal introduction to.
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
1 Math/CSE 1019C: Discrete Mathematics for Computer Science Fall 2011 Suprakash Datta Office: CSEB 3043 Phone: ext
Discrete Mathematics CS204 Spring CS204 Discrete Mathematics Instructor: Professor Chin-Wan Chung (Office: Rm 3406, Tel:3537) 1.Lecture 1)Time:
Discrete Mathematics Lecture1 Miss.Amal Alshardy.
CISC 2315 Discrete Structures Professor William G. Tanner, Jr. Spring 2011 Slides created by James L. Hein, author of Discrete Structures, Logic, and Computability,
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
Discrete Structures – CS Text Discrete Mathematics and Its Applications Kenneth H. Rosen (7 th Edition) 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.
Chapter 7 Logic, Sets, and Counting
September1999 CMSC 203 / 0201 Fall 2002 Week #1 – 28/30 August 2002 Prof. Marie desJardins.
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
Propositional Logic ITCS 2175 (Rosen Section 1.1, 1.2)
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
Chapter 1: The Foundations: Logic and Proofs
The Foundations: Logic and Proof, Sets, and Foundations PROPOSITIONS A proposition is a declarative sentence that is either True or False, but not the.
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
LECTURE 1. Disrete mathematics and its application by rosen 7 th edition THE FOUNDATIONS: LOGIC AND PROOFS 1.1 PROPOSITIONAL LOGIC.
رياضيات متقطعة لعلوم الحاسب MATH 226. Text books: (Discrete Mathematics and its applications) Kenneth H. Rosen, seventh Edition, 2012, McGraw- Hill.
Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.
CS104 The Foundations: Logic and Proof 1. 2 What is Discrete Structure?  Discrete Objects  Separated from each other (Opposite of continuous)  e.g.,
Discrete Structures MT217 Lecture 01. Course Objectives Express statements with the precision of formal logic Analyze arguments to test their validity.
Simple Logic.
CENG 424-Logic for CS Introduction Based on the Lecture Notes of Konstantin Korovin, Valentin Goranko, Russel and Norvig, and Michael Genesereth.
Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.
Niu Kun Discrete Mathematics Chapter 1 The Foundations: Logic and Proof, Sets, and Functions Niu Kun 离散数学.
Logic.
MATH 245 Spring 2009 This is mathematics for computer science
CPCS222 Discrete Structures I
Ch.1 (Part 1): The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Information Technology Department
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
(1.4) An Introduction to Logic
Discrete Mathematics and Its Applications Kenneth H
Discrete Mathematics Lecture 2: Propositional Logic
CSE 321 Discrete Structures
MAT 3100 Introduction to Proof
Presentation transcript:

1/10/ Math/CSE 1019N: Discrete Mathematics for Computer Science Winter 2007 Suprakash Datta Office: CSEB 3043 Phone: ext Course page:

1/10/ Administrivia Kenneth H. Rosen. Discrete Mathematics and Its Applications, Sixth Edition. McGraw Hill, Lectures: Tu-Th 10:00-11:30 am (CLH E) Exams: 2 tests (40%), final (40%) Homework (20%): equally divided between 3 or 4 assignments. Slides: should be available the previous evening Office hours: Tuesday 12-2 pm, Wed 1-2 pm or by appointment at CSEB Textbook:

1/10/ Administrivia – contd. Cheating will not be tolerated. Visit the webpage for more details on policies. TA: Tutorials/office hours TBA. I will have some extra-credit quizzes. These will be announced beforehand. HW submitted late will not be graded.

1/10/ Course objectives We will focus on two major goals: Basic tools and techniques in discrete mathematics –Propositional logic –Set Theory –Simple algorithms –Induction, recursion –Counting techniques (Combinatorics) –Introductory graph theory Precise and rigorous mathematical reasoning –Writing proofs

1/10/ To do well you should: Study with pen and paper Ask for help immediately Practice, practice, practice… Follow along in class rather than take notes Ask questions in class Keep up with the class Read the book, not just the slides

1/10/ Today Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic:    Implications:  

1/10/ Why study propositional logic? A formal mathematical “language” for precise reasoning. Start with propositions. Add other constructs like negation, conjunction, disjunction, implication etc. All of these are based on ideas we use daily to reason about things.

1/10/ Propositions Declarative sentence Must be either True or False. Propositions: York University is in Toronto York University is in downtown Toronto All students at York are Computer Sc. majors. Not propositions: Do you like this class? There are x students in this class.

1/10/ Propositions - 2 Truth value: True or False Variables: p,q,r,s,… Negation:  p (“not p”) Truth tables p pp TF FT

1/10/ Conjunction, Disjunction Conjunction: p  q [“and”] Disjunction: p  q [“or”] pq p  qp  qp  q TTTT TFFT FTFT FFFF

1/10/ Exclusive OR (XOR) p  q – T if p and q have different truth values, F otherwise Colloquially, we often use OR ambiguously – “an entrée comes with soup or salad” implies XOR, but “students can take MATH XXXX if they gave taken MATH 2320 or MATH 1019” usually means the normal OR (so a student who has taken both is still eligible for MATH XXXX).

1/10/ Conditional p  q [“if p then q”] p: hypothesis, q: conclusion E.g.: “If you turn in a homework late, it will not be graded”; “If you get 100% in this course, you will get an A+”. TRICKY: Is p  q TRUE if p is FALSE? YES!! Think of “If you get 100% in this course, you will get an A+” as a promise – is the promise violated if someone gets 50% and does not receive an A+?

1/10/ Conditional - 2 p  q [“if p then q”] Truth table: pqp  qp  q  p  q TTTT TFFF FTTT FFTT Note the truth table of  p  q

1/10/ Logical Equivalence p  q and  p  q are logically equivalent Truth tables are the simplest way to prove such facts. We will learn other ways later.

1/10/ Contrapositive Contrapositive of p  q is  q   p Any conditional and its contrapositive are logically equivalent (have the same truth table) – Check by writing down the truth table. E.g. The contrapositive of “If you get 100% in this course, you will get an A+” is “If you do not get an A+ in this course, you did not get 100%”.

1/10/ Converse Converse of p  q is q  p Not logically equivalent to conditional Ex 1: “If you get 100% in this course, you will get an A+” and “If you get an A+ in this course, you scored 100%” are not equivalent. Ex 2: If you won the lottery, you are rich.

1/10/ Other conditionals Inverse: inverse of p  q is  p   q How is this related to the converse? Biconditional: “If and only if” True if p,q have same truth values, flase otherwise. Q: How is this related to XOR? Can also be defined as (p  q)  (q  p)

1/10/ Readings and notes Read pages Think about the notion of truth tables. Master the rationale behind the definition of conditionals. Practice translating English sentences to propositional logic statements.