Discrete Mathematics. Propositional Logic 10/8/2015 What’s a proposition? PropositionsNot Propositions 3 + 2 = 32Bring me coffee! CS173 is Bryan’s favorite.

Slides:



Advertisements
Similar presentations
Copyright 2008, Scott Gray1 Propositional Logic 3) Truth Tables.
Advertisements

Chapter 1: The Foundations: Logic and Proofs
Propositional Equivalences
Chapter 2 Fundamentals of Logic Dept of Information management National Central University Yen-Liang Chen.
Grading Lecture attendance: -1% per 2 unexcused absences
Propositional Equivalences. L32 Agenda Tautologies Logical Equivalences.
Propositions and Connectives Conditionals and Bi-conditionals Quantifiers.
CS128 – Discrete Mathematics for Computer Science
Logic Chapter 2. Proposition "Proposition" can be defined as a declarative statement having a specific truth-value, true or false. Examples: 2 is a odd.
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 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
From Chapter 4 Formal Specification using Z David Lightfoot
Introduction to Logic Logical Form: general rules
First Order Logic. Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not.
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
TRUTH TABLES. Introduction Statements have truth values They are either true or false but not both Statements may be simple or compound Compound statements.
CS104 : Discrete Structures
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
Propositions and Truth Tables. Proposition: Makes a claim that may be either true or false; it must have the structure of a complete sentence.
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.
Course Outline Book: Discrete Mathematics by K. P. Bogart Topics:
Discrete Maths 2. Propositional Logic Objective
MATERI II PROPOSISI. 2 Tautology and Contradiction Definition A tautology is a statement form that is always true. A statement whose form is a tautology.
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
1 Logic Logic is a discipline that studies the principles and methods used in correct reasoning It includes: A formal language for expressing statements.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
Chap. 2 Fundamentals of Logic. Proposition Proposition (or statement): an declarative sentence that is either true or false, but not both. e.g. –Margret.
Lecture 1.1: Course Overview, and Propositional Logic CS 250, Discrete Structures, Fall 2013 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
Tautologies, contradictions, contingencies
Lecture 1.2: Equivalences, and Predicate Logic* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren, Zeph.
Reading: Chapter 4 (44-59) from the text book
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 7 Logic, Sets, and Counting
Validity and Conditionals There is a relationship between validity of an argument and a corresponding conditional.
CS100 : Discrete Structures
Lecture 9 Conditional Statements CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
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
Conditional Statements – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Conditional Statements Reading: Kolman, Section 2.2.
The Foundations: Logic and Proof, Sets, and Foundations PROPOSITIONS A proposition is a declarative sentence that is either True or False, but not the.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Joan Ridgway. If a proposition is not indeterminate then it is either true (T) or false (F). True and False are complementary events. For two propositions,
Lecture 1.2: Equivalences, and Predicate Logic CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph.
Chapter 2 Fundamentals of Logic 1. What is a valid argument or proof?
Symbolic Logic The Following slide were written using materials from the Book: The Following slide were written using materials from the Book: Discrete.
LECTURE 1. Disrete mathematics and its application by rosen 7 th edition THE FOUNDATIONS: LOGIC AND PROOFS 1.1 PROPOSITIONAL LOGIC.
Mathematics for Computing Lecture 2: Computer Logic and Truth Tables Dr Andrew Purkiss-Trew Cancer Research UK
Mathematics for Comter I Lecture 3: Logic (2) Propositional Equivalences Predicates and Quantifiers.
 To combine propositions using connectives  To construct the truth table of a given compound proposition  To define de Morgan Law for logic  To define.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 01: Boolean Logic Sections 1.1 and 1.2 Jarek Rossignac.
CS104 The Foundations: Logic and Proof 1. 2 What is Discrete Structure?  Discrete Objects  Separated from each other (Opposite of continuous)  e.g.,
Discrete Mathematical الرياضيات المتقطعة Dr. Ahmad Tayyar Al Israa University
Chapter 1 Logic and proofs
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
Discrete Mathematical
Lecture 1.2: Equivalences, and Predicate Logic
DISCRETE MATHEMATICS CHAPTER I.
CSNB 143 Discrete Mathematical Structures
Chapter 8 Logic Topics
Information Technology Department
Symbolic Logic 2/25/2019 rd.
LOGICAL EQUIVALENCES - DISCRETE MATHEMATICS.
Presentation transcript:

Discrete Mathematics

Propositional Logic 10/8/2015 What’s a proposition? PropositionsNot Propositions = 32Bring me coffee! CS173 is Bryan’s favorite class. CS173 is her favorite class. Every cow has 4 legs There is other life in the universe. Do you like Cake? A proposition is a declarative statement that’s either TRUE or FALSE (but not both).

Propositional Logic - negation 10/8/2015 Suppose p is a proposition. The negation of p is written  p and has meaning: “It is not the case that p.” Ex. CS173 is NOT Bryan’s favorite class. Truth table for negation: p pp TFTF FTFT Notice that  p is a proposition!

Propositional Logic - conjunction 10/8/2015 Conjunction corresponds to English “and.” p  q is true exactly when p and q are both true. Ex. Amy is curious AND clever. Truth table for conjunction: pqp  q TTFFTTFF TFTFTFTF TFFFTFFF

Propositional Logic - disjunction 10/8/2015 Disjunction corresponds to English “or.” p  q is when p or q (or both) are true. Ex. Michael is brave OR nuts. Truth table for disjunction: pqp  q TTFFTTFF TFTFTFTF TTTFTTTF

Propositional Logic - logical equivalence 10/8/2015 To answer, we need the notion of “logical equivalence.” p is logically equivalent to q if their truth tables are the same. We write p  q.

Propositional Logic - implication 10/8/2015 Implication: p  q corresponds to English “if p then q,” or “p implies q.” If it is raining then it is cloudy. If there are 200 people in the room, then I am the Easter Bunny. If p then 2+2=4. Truth table for implication: pqp  q TTFFTTFF TFTFTFTF TFTTTFTT

Propositional Logic - logical equivalence 10/8/2015 Challenge: Try to find a proposition that is equivalent to p  q, but that uses only the connectives , , and . pqp  q TTFFTTFF TFTFTFTF TFTTTFTT pq  pq   p TTFFTTFF TFTFTFTF FFTTFFTT TFTTTFTT

Logical equivalence 10/8/2015

Propositional Logic - proof of 1 famous  10/8/2015 Distributivity: p  (q  r)  (p  q)  (p  r) pqr q  rq  rp  (q  r)p  qp  qp  rp  r(p  q)  (p  r) TTTTTTTT TTFFTTTT TFTFTTTT TFFFTTTT FTTTTTTT FTFFFTFF FFTFFFTF FFFFFFFF I could say “prove a law of distributivity.”

Propositional Logic - special definitions 10/8/2015 Contrapositives: p  q and  q   p Ex. “If it is noon, then I am hungry.” “If I am not hungry, then it is not noon.” Converses: p  q and q  p Ex. “If it is noon, then I am hungry.” “If I am hungry, then it is noon.” Inverses: p  q and  p   q Ex. “If it is noon, then I am hungry.” “If it is not noon, then I am not hungry.” One of the pair of propositions is equivalent. p  q   q   p

Propositional Logic - 2 more defn… 10/8/2015 A tautology is a proposition that’s always TRUE. A contradiction is a proposition that’s always FALSE. p ppp  pp  pp  pp  p TF FT TTTT FFFF

Propositional Logic 10/8/2015  ( p   q)  q   p  q  ( p   q)  q     (  p   q)  q (  p  q)  q  p  (q  q)  p  q DeMorgan’s Involution Associativity Idempotent

Propositional Logic - one last proof 10/8/2015 Show that [p  (p  q)]  q is a tautology. We use  to show that [p  (p  q)]  q  T. substitution for  [p  (p  q)]  q  [(p   p)  (p  q)]  q  [p  (  p  q)]  q  [ F  (p  q)]  q  (p  q)  q   (p  q)  q  (  p   q)  q   p  (  q  q )   p  T  T T distributive complement identity substitution for  DeMorgan’s associative Complement Identity

Predicate Logic - everybody loves somebody 10/8/2015 Proposition? = 5 X + 2 = 5 X + 2 = 5 for any choice of X in {1, 2, 3} X + 2 = 5 for some X in {1, 2, 3} YESNO YES

Predicate Logic 10/8/2015 Alicia eats pizza at least once a week. Garrett eats pizza at least once a week. Allison eats pizza at least once a week. Gregg eats pizza at least once a week. Ryan eats pizza at least once a week. Meera eats pizza at least once a week. Ariel eats pizza at least once a week. …

Predicates 10/8/2015 Alicia eats pizza at least once a week. Define: EP(x) = “x eats pizza at least once a week.” Universe of Discourse - x is a student in CSER1209 A predicate, or propositional function, is a function that takes some variable(s) as arguments and returns True or False. Note that EP(x) is not a proposition, EP(Alicia) is. …

Predicates 10/8/2015 Suppose Q(x,y) = “x > y” Proposition? Q(x,y) Q(3,4) Q(x,9) NOYESNO Predicate? Q(x,y) Q(3,4) Q(x,9) YESNOYES

THANK YOU