22C:19 Discrete Structures Introduction and Scope: Propositions

Slides:



Advertisements
Similar presentations
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.
Advertisements

Discrete Mathematics Math 6A Instructor: M. Welling.
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.
22C:19 Discrete Math Introduction and Scope Propositions Fall 2011 Sukumar Ghosh.
Adapted from Discrete Math
The Laws of Logic: Boolean Algebra A State High Math Club Presentation START==TRUE.
IB Math Studies – Topic 3. IB Course Guide Description.
CSCI2110 – Discrete Mathematics Tutorial 8 Propositional Logic Wong Chung Hoi (Hollis)
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
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
CSci 2011 Textbook ^Discrete Mathematics and Its Applications,  Rosen  6th Edition  McGraw Hill  2006.
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
CS 2210 (22C:019) Discrete Structures Introduction and Scope: Propositions Spring 2015 Sukumar Ghosh.
Copyright © Curt Hill Mathematical Logic An Introduction.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
CS201: Data Structures and Discrete Mathematics I
September1999 CMSC 203 / 0201 Fall 2002 Week #1 – 28/30 August 2002 Prof. Marie desJardins.
Propositional Logic ITCS 2175 (Rosen Section 1.1, 1.2)
Chapter 1: The Foundations: Logic and Proofs
Chapter 1: The Foundations: Logic and Proofs
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
CSci 2011 Recap ^Propositional operation summary not andorconditionalBi-conditional pq ppqqpqpqpqpqpqpqpqpq TTFFTTTT TFFTFTFF FTTFFTTF FFTTFFTT.
رياضيات متقطعة لعلوم الحاسب MATH 226. Text books: (Discrete Mathematics and its applications) Kenneth H. Rosen, seventh Edition, 2012, McGraw- Hill.
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.
Conditional statement or implication IF p then q is denoted p ⇒ q p is the antecedent or hypothesis q is the consequent or conclusion ⇒ means IF…THEN.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 01: Boolean Logic Sections 1.1 and 1.2 Jarek Rossignac.
Logic Hubert Chan [O1 Abstract Concepts] [O2 Proof Techniques]
Chapter 1 Propositional Logic
Discrete Mathematical
Propositional Logic.
Advanced Algorithms Analysis and Design
DISCRETE MATHEMATICS CHAPTER I.
CS 2210:0001 Discrete Structures Introduction and Scope: Propositions
CSNB 143 Discrete Mathematical Structures
Lecture 1 – Formal Logic.
Discrete Mathematics Logic.
CS 202, Spring 2008 Epp, sections 1.1 and 1.2
Niu Kun Discrete Mathematics Chapter 1 The Foundations: Logic and Proof, Sets, and Functions Niu Kun 离散数学.
COMP 1380 Discrete Structures I Thompson Rivers University
Lecture 03 Logic and Propositional Calculus Profs. Koike and Yukita
Citra Noviyasari, S.Si, MT
MATH 245 Spring 2009 This is mathematics for computer science
(CSC 102) Discrete Structures Lecture 2.
CPCS222 Discrete Structures I
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I
Discrete Mathematics Lecture # 2.
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Chapter 8 Logic Topics
CSCI 3310 Mathematical Foundation of Computer Science
Set Operations Section 2.2.
CS100: Discrete structures
Information Technology Department
CS 220: Discrete Structures and their Applications
CHAPTER 1: LOGICS AND PROOF
CS201: Data Structures and Discrete Mathematics I
Discrete Math (2) Haiming Chen Associate Professor, PhD
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I
Discrete Mathematics Logic.
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
CSE 321 Discrete Structures
COMP 1380 Discrete Structures I Thompson Rivers University
The Foundations: Logic and Proofs
Discrete Structures Prepositional Logic 2
A THREE-BALL GAME.
CS201: Data Structures and Discrete Mathematics I
The Foundations: Logic and Proofs
Presentation transcript:

22C:19 Discrete Structures Introduction and Scope: Propositions Spring 2014 Sukumar Ghosh

The Scope Discrete mathematics studies mathematical structures that are fundamentally discrete, not supporting or requiring the notion of continuity (Wikipedia). Deals with countable things.

Why Discrete Math? Discrete math forms the basis for computer science: Sequences Counting, large numbers, cryptography Digital logic (how computers compute) Algorithms Program correctness Probability (includes analysis of taking risks) “Continuous” math forms the basis for most physical and biological sciences

Propositions A proposition is a statement that is either true or false “The sky is blue” “Today the temperature is below freezing” “9 + 3 = 12” Not propositions: “Who is Bob?” “How many persons are there in this group?” “X + 1 = 7.”

Propositional (or Boolean) variables These are variables that refer to propositions. Usually denoted by lower case letters p, q, r, s, etc. Each can have one of two values true (T) or false (F) A proposition can be: A single variable p A formula of multiple variables like p ∧ q, s ∨¬r)

Propositional (or Boolean) operators

Logical operator: NOT

Logical operator: AND

Logical operator: OR

Logical operator: EXCLUSIVE OR Note. p ⊕ q is false if both p, q are true or both are false

(Inclusive) OR or EXCLUSIVE OR?

Logical Operator NAND and NOR

Conditional Operator A conditional, also means an implication means “if then ”: Symbol: as in Example: If this is an apple ( ) then it is a fruit ( ) The antecedent The consequence

Conditional operators

Conditional operators

Set representations A proposition p can also be represented by a set (a collection of elements) for which the proposition is true. Universe p p p p p ∧ q q q ¬p p ∨ q Venn diagram

Bi-conditional Statements

Translating into English

Translating into English Great for developing intuition about propositional operators. IF p (is true) then q (must be true) p (is true) ONLY IF q (is true) IF I am elected (p) then I will lower taxes (q) p is a sufficient condition for q q is a necessary condition for p

Translating into English Example 1. p = Midwest q = Iowa if I live in Iowa then I live in the Midwest I live in Iowa only if I live in the Midwest Example 2. You can access the Internet from campus only if you are a CS major or an ECE major or a MATH major, or you are not a freshman (f): (cs ∨ECE∨MATH ∨ ¬ f) ⟶ Internet

Precedence of Operators

Boolean operators in search

Tautology and Contradiction

Equivalence

Examples of Equivalence

Examples of Equivalence

More Equivalences Associative Laws Distributive Law Law of absorption

De Morgan’s Law You can take 22C:21 if you take 22C:16 and 22M:26 You cannot take 22C:21 if you have not taken 22C:16 or 22M:26

How to prove Equivalences Examples? Follow class lectures.

Muddy Children Puzzle A father tells his two children, a boy and a girl, to play in the backyard without getting dirty. While playing, both children get mud on their foreheads. After they returned home, the father said: “at least one of you has a muddy forehead,” and then asked the children to answer YES or NO to the question: “Do you know if you have a muddy forehead?” the father asked the question twice. How will the children answer each time?

Wrap up Understand propositions, logical operators and their usage. Understand equivalence, tautology, and contradictions. Practice proving equivalences, tautology, and contradictions. Study the Muddy Children Puzzle from the book.