COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.

Slides:



Advertisements
Similar presentations
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
Advertisements

CS128 – Discrete Mathematics for Computer Science
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Discrete Mathematics Lecture 1 Logic of Compound Statements Harper Langston New York University.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Discrete Mathematics Math 6A Instructor: M. Welling.
CSE115/ENGR160 Discrete Mathematics 01/17/12 Ming-Hsuan Yang UC Merced 1.
Chapter 2: The Logic of Compound Statements 2.1 Logical Forms and Equivalence 12.1 Logical Forms and Equivalences Logic is a science of the necessary laws.
Adapted from Discrete Math
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
The Foundations: Logic and Proofs
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
Propositions and Truth Tables
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.3, Slide Logic The Study of What’s True or False or Somewhere in Between.
Chapter 2 – Fundamentals of Logic. Outline Basic Connectives and Truth Tables Logical Equivalence: The Laws of Logic Ligical Implication: Rules of Inference.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.3, Slide Logic The Study of What’s True or False or Somewhere in Between.
2009/9 1 Logic and Proofs §1.1 Introduction §1.2 Propositional Equivalences §1.3 Predicates and Quantifiers §1.4 Nested Quantifiers §1.5~7 Methods of Proofs.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
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.
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
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
Dr. Amer Rasheed COMSATS Institute of Information Technology
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
LOGIC Lesson 2.1. What is an on-the-spot Quiz  This quiz is defined by me.  While I’m having my lectures, you have to be alert.  Because there are.
September1999 CMSC 203 / 0201 Fall 2002 Week #1 – 28/30 August 2002 Prof. Marie desJardins.
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.
Venn Diagrams Truth Sets & Valid Arguments Truth Sets & Valid Arguments Truth Tables Implications Truth Tables Implications Truth Tables Converse, Inverse,
Chapter 1: The Foundations: Logic and Proofs
Chapter 7. Propositional and Predicate Logic Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Discrete Structures Class Meeting 1. Outline of Today Information sheet Questionnaire Quiz 0 Learning mathematics – Reading math – Solving problems.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 01: Boolean Logic Sections 1.1 and 1.2 Jarek Rossignac.
Discrete Math by R.S. Chang, Dept. CSIE, NDHU1 Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems.
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
Simple Logic.
Chapter 1 Propositional Logic
Chapter 7. Propositional and Predicate Logic
2. The Logic of Compound Statements Summary
Discrete Mathematics Lecture 1 Logic of Compound Statements
CSNB 143 Discrete Mathematical Structures
Discrete Mathematics Logic.
Niu Kun Discrete Mathematics Chapter 1 The Foundations: Logic and Proof, Sets, and Functions Niu Kun 离散数学.
COMP 1380 Discrete Structures I Thompson Rivers University
CPCS222 Discrete Structures I
Ch.1 (Part 1): The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Chapter 8 Logic Topics
2 Chapter Introduction to Logic and Sets
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
CS201: Data Structures and Discrete Mathematics I
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Applied Discrete Mathematics Week 1: Logic
1 Chapter An Introduction to Problem Solving
Discrete Mathematics and Its Applications Kenneth H
Discrete Mathematics Lecture 2: Propositional Logic
Discrete Mathematics Logic.
1 Chapter An Introduction to Problem Solving
MAT 3100 Introduction to Proof
Chapter 7. Propositional and Predicate Logic
Discrete Mathematics Lecture 2: Propositional Logic
COMP 1380 Discrete Structures I Thompson Rivers University
CHAPTER 3 Logic.
CS201: Data Structures and Discrete Mathematics I
Presentation transcript:

COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014

Lecture № 1 Fundamentals of Logic

Code of Ethics  All course materials are adapted version of the textbook: Susanna S. Epp, Discrete Mathematics with Applications, Fourth Edition, Cengage Learning.  Some images – McGrawHill  For materials from other sources, please see the copyright reverence below each slide. 9/17/2015

Use of Logic  Propositional Logic  First Order Logic (Quantifiers)/ Predicate Logic  Boolean Algebra 9/17/2015

Outline  Logical Form and Logical Equivalence  Statements; Compound Statements; Truth Values; Evaluating the Truth of More General  Compound Statements; Logical Equivalence; Tautologies and Contradictions;  Summary of Logical Equivalences  Conditional Statements  Logical Equivalences Involving →; Representation of If-Then As Or ;  The Negation of a Conditional Statement;  The Contrapositive of a Conditional Statement;  The Converse and Inverse of a Conditional Statement; Only If and the Biconditional;  Necessary and Sufficient Conditions;  Valid and Invalid Arguments  Modus Ponens and Modus Tollens;  Additional Valid Argument Forms: Rules of Inference;

Use of Logic  In mathematics  Give a precise meaning of statements  Distinguish between valid and invalid arguments  Provide use of “correct” reasoning  Natural language can be very ambiguous  He ate the cookies on the couch  This is a good soup  You could do with a new automobile. How about a test drive? 9/17/2015

Use of Logic  Natural language can be very ambiguous  This is a good soup  You could do with a new automobile. How about a test drive?  I shot an elephant in my pajamas. 9/17/2015

Use of Logic  In computing  Design new data/knowledge from existing fact  Design of computer circuits  Construction of computer programs  Verification of correctness of programs and circuit design  Specification 9/17/2015

Statements (propositions)  Propositional logic deals with statements and their truth value  Truth values are TRUE (T or 1) and FALSE (F or 0) 9/17/2015

Example Statements  1+1= 2 (statement, T)  The moon is made of cheese (statement, F)  Go home! (no statement, imperative)  What a beautiful garden (no statement, exclamation)  Alice said: “What a beautiful garden ” (statement, depends on Alice)  Y+1=2 (no statement, uncertain) 9/17/2015

Logic connectives 9/17/2015

Logic connectives 9/17/2015

Compound Statements 9/17/2015

Order of Operations  9/17/2015

Example  9/17/2015

Translating from English to Symbols: But and Neither-Nor  “Jim is tall but he is not heavy.”  Shakespeare: “Neither a borrower nor a lender be” 9/17/2015

And, Or, and Inequalities 9/17/2015

Truth Tables 9/17/2015

Truth Table of negation  Unary connective p: “Today is Wednesday”  p: “Today is not Wednesday” 9/17/2015

 Binary connective  Example p: “Today is Wednesday” q: “It is raining” p  q: “Today is Wednesday and it is raining” Truth Table of conjunction 9/17/2015

Truth Table of disjunction 9/17/2015  Binary connective  Example p: “Today is Friday” q: “Today is Saturday” p  q: “Today is Friday or Saturday”

 Binary connective  Example p  q “You can follow the rules or be disqualified” Truth Table of exclusive or 9/17/2015

Truth Table of implication  Binary connective  Example p -> q: “If black is white, then we live in Antarctica” 9/17/2015

Implication as a promise 9/17/2015

MORE READING: CHAPTER 2 SUSANNA S. EPP, DISCRETE MATHEMATICS WITH APPLICATIONS Questions? 9/17/2015