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

Slides:



Advertisements
Similar presentations
Logic ChAPTER 3.
Advertisements

Chapter 2 Fundamentals of Logic Dept of Information management National Central University Yen-Liang Chen.
John Rosson Thursday February 15, 2007 Survey of Mathematical Ideas Math 100 Chapter 3, Logic.
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
CS128 – Discrete Mathematics for Computer Science
The Foundation: Logic Conditional Statements Muhammad Arief download dari
Chapter 1 The Logic of Compound Statements. Section 1.2 – 1.3 (Modus Tollens) Conditional and Valid & Invalid Arguments.
Discrete Mathematics Lecture 1 Logic of Compound Statements Harper Langston 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.
1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.
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.
Introduction to Logic Logical Form: general rules
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 1 Section 1.4 More on Conditionals. There are three statements that are related to a conditional statement. They are called the converse, inverse.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
3.6 Analyzing Arguments with Truth Tables
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
Chap. 2 Fundamentals of Logic. Proposition Proposition (or statement): an declarative sentence that is either true or false, but not both. e.g. –Margret.
(CSC 102) Lecture 3 Discrete Structures. Previous Lecture Summary Logical Equivalences. De Morgan’s laws. Tautologies and Contradictions. Laws of Logic.
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.
Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements
Lecture Propositional Equivalences. Compound Propositions Compound propositions are made by combining existing propositions using logical operators.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
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.
Chapter Four Proofs. 1. Argument Forms An argument form is a group of sentence forms such that all of its substitution instances are arguments.
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.
Aerospace Engineering Laboratory I
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
Venn Diagrams Truth Sets & Valid Arguments Truth Sets & Valid Arguments Truth Tables Implications Truth Tables Implications Truth Tables Converse, Inverse,
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.4, Slide 1 3 Logic The Study of What’s True or False or Somewhere in Between 3.
Chapter 2 Fundamentals of Logic 1. What is a valid argument or proof?
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Symbolic Logic The Following slide were written using materials from the Book: The Following slide were written using materials from the Book: Discrete.
Discrete Structures Class Meeting 1. Outline of Today Information sheet Questionnaire Quiz 0 Learning mathematics – Reading math – Solving problems.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
Lecture 10 Methods of Proof CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
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.
Module Code MA0003NI: Computing mathematics Lecture for Week Autumn.
Chapter 1 Logic and proofs
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
Simple Logic.
Chapter 1 Propositional Logic
Arguments with Quantified Statements
2. The Logic of Compound Statements Summary
3. The Logic of Quantified Statements Summary
DISCRETE MATHEMATICS CHAPTER I.
Discrete Mathematics Logic.
Lecture 03 Logic and Propositional Calculus Profs. Koike and Yukita
(CSC 102) Discrete Structures Lecture 2.
CPCS222 Discrete Structures I
Discrete Mathematics Lecture # 2.
Chapter 8 Logic Topics
2 Chapter Introduction to Logic and Sets
Information Technology Department
Propositional Equivalence (§1.2)
CS201: Data Structures and Discrete Mathematics I
1 Chapter An Introduction to Problem Solving
Discrete Mathematics Logic.
1 Chapter An Introduction to Problem Solving
Valid and Invalid Arguments
Logic and Reasoning.
CS201: Data Structures and Discrete Mathematics I
Presentation transcript:

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

Lecture № 2 Fundamentals of Logic

Outline  Logical Form and Logical Equivalence  Logical Equivalence; Tautologies and Contradictions;  Summary of Logical Equivalences  Conditional Statements  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;

Playing with implication 10/23/2015

Playing with implication 10/23/2015

Truth Table of equivalence 10/23/2015

Logically Equivalent Statements 10/23/2015

Tautologies 10/23/2015

Contradictions 10/23/2015

Logic Equivalences 10/23/2015 or

Why this is important? 10/23/2015

Examples 10/23/2015

Examples 10/23/2015

Equivalence and Tautology 10/23/2015

Example 10/23/2015

Examples 10/23/2015

Truth Tables 10/23/2015 pq pqpqqpqppqpq pp qq pqpq  (p  q)  p  q FFFFTTTTTT FTTTTTFTFF TFTTFFTFFF TTTTTFFTFF

Double Negation 10/23/2015

DeMorgan’s Laws 10/23/2015 pq pqpqpqpq pp qq  p  q  (p  q)  (p  q)  p  q FFFFTTTTTT FTTFTFTFTF TFTFFTTFTF TTTTFFFFFF

Example  Write in C++ the condition for floating point variable size, in which the message “Present” will be displayed for the following code fragment if ( size > 25 || size == 19 ) cout<<”Future”; else if ( size 2) cout<<"Past"; else cout <<"Present"; 10/23/2015

“Algebraic” Laws of Logic 10/23/2015

“Logic” Laws of Logic 10/23/2015

Number of Rows in Truth Table 10/23/2015

Expressing Connectives 10/23/2015

Example 10/23/2015

Example 10/23/2015

Example: Decreasing number of comparisons 10/23/2015

Example: Decreasing number of comparisons 10/23/2015

Example 10/23/2015

Example 10/23/2015

Logic Inference

First Law of Substitution 10/23/2015

Second Law of Substitution 10/23/2015

Logic inference 10/23/2015

Inference and Tautology 10/23/2015

General Definition of Inference 10/23/2015

Examples  Tautology  X   X  Logical Contradiction  X   X  Negation of Tautology  Valid – if all values are true – the logic value is true  X  Y  X  Y  Logic Equivalence 10/23/2015 and

Inference Rules  “Modus ponens"  "Modus tollens” 10/23/2015

Modus Ponens 10/23/2015

Rule of Tollens 10/23/2015

Example 10/23/2015

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