UMBC CMSC 203, Section 0401 -- Fall 20041 CMSC 203, Section 0401 Discrete Structures Fall 2004 Matt Gaston

Slides:



Advertisements
Similar presentations
Propositional Equivalences
Advertisements

Propositional Equivalences
CSE 311: Foundations of Computing Fall 2013 Lecture 3: Logic and Boolean algebra.
08 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
CSE 311 Foundations of Computing I Spring 2013 Lecture 1 Propositional Logic.
Laws of , , and  Excluded middle law Contradiction law P   P  T P   P  F NameLaw Identity laws P  F  P P  T  P Domination laws P  T  T P.
CSE 311 Foundations of Computing I Autumn 2011 Lecture 1 Propositional Logic.
1 CA 208 Logic Ex4 Commutativity (P  Q)  Associativity P  (Q  R)  (P  Q)  R Distributivity P  (Q  R)  Idempotency.
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.
CSE 311 Foundations of Computing I Autumn 2011 Lecture 2 More Propositional Logic Application: Circuits Propositional Equivalence.
The Foundations: Logic and Proofs
Discrete Maths 2. Propositional Logic Objective
CSE 311 Foundations of Computing I Autumn 2012 Lecture 1 Propositional Logic 1.
CS 285- Discrete Mathematics Lecture 2. Section 1.1 Propositional Logic Propositions Conditional Statements Truth Tables of Compound Propositions Translating.
Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
(CSC 102) Lecture 3 Discrete Structures. Previous Lecture Summary Logical Equivalences. De Morgan’s laws. Tautologies and Contradictions. Laws of Logic.
CSci 2011 Discrete Mathematics Lecture 6
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
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.
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.
September1999 CMSC 203 / 0201 Fall 2002 Week #1 – 28/30 August 2002 Prof. Marie desJardins.
Section 1.2: Propositional Equivalences In the process of reasoning, we often replace a known statement with an equivalent statement that more closely.
Chapter 1: The Foundations: Logic and Proofs
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.
Discrete Mathematics Lecture # 7. Bi conditional  If p and q are statement variables, the bi conditional of p and q is  “ p if, and only if, q ” and.
رياضيات متقطعة لعلوم الحاسب MATH 226. Text books: (Discrete Mathematics and its applications) Kenneth H. Rosen, seventh Edition, 2012, McGraw- Hill.
Discrete Structures Class Meeting 1. Outline of Today Information sheet Questionnaire Quiz 0 Learning mathematics – Reading math – Solving problems.
Mathematics for Computing Lecture 2: Computer Logic and Truth Tables Dr Andrew Purkiss-Trew Cancer Research UK
Spring 2003CMSC Discrete Structures1 Let’s get started with... Logic !
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.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 01: Boolean Logic Sections 1.1 and 1.2 Jarek Rossignac.
CSE 311: Foundations of Computing Fall 2013 Lecture 1: Propositional logic.
Law of logic Lecture 4.
Module Code MA0003NI: Computing mathematics Lecture for Week Autumn.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
2. The Logic of Compound Statements Summary
The Foundations: Logic and Proofs
Niu Kun Discrete Mathematics Chapter 1 The Foundations: Logic and Proof, Sets, and Functions Niu Kun 离散数学.
Lecture 03 Logic and Propositional Calculus Profs. Koike and Yukita
Citra Noviyasari, S.Si, MT
Logical Equivalence of Propositions
COT 3100, Spr Applications of Discrete Structures
(CSC 102) Discrete Structures Lecture 2.
Discussion #10 Logical Equivalences
CSE 2353 – September 4th 2002 Logic.
Mathematics for Computing
Chapter 8 Logic Topics
Administrivia Course Web:
Propositional Equivalences
CS100: Discrete structures
Information Technology Department
Propositional Equivalence (§1.2)
CS 220: Discrete Structures and their Applications
CSE 311 Foundations of Computing I
Propositional Equivalences
CSE 311 Foundations of Computing I
CSE 311 Foundations of Computing I
Lecture 2: Propositional Equivalences
Discrete Mathematics Lecture # 3.
CSE 321 Discrete Structures
CSE 321 Discrete Structures
Cs Discrete Mathematics
The Foundations: Logic and Proofs
1.3 Propositional Equivalences
Logic and Reasoning.
Discrete Structures Prepositional Logic 2
The Foundations: Logic and Proofs
Propositional Satisfiability
Presentation transcript:

UMBC CMSC 203, Section Fall CMSC 203, Section 0401 Discrete Structures Fall 2004 Matt Gaston

UMBC CMSC 203, Section Fall Course Overview Course Syllabus Academic Integrity Course Schedule Survey

UMBC CMSC 203, Section Fall Lecture 1 Logic and Propositional Equivalences Ch

UMBC CMSC 203, Section Fall Ex – Converse, Contrapositive, Inverse The home team wins whenever it is raining. Rewrite: If it is raining, then the home team wins. Converse: If the home team wins, then it is raining. Contrapositive: If the home team does not win, then it is not raining Inverse: If it is not raining, then the home team does not win.

UMBC CMSC 203, Section Fall Ex Translation “You cannot ride the roller coaster if you are under four feet tall unless you are older than 16 years old.” Propositions:  q is “You cannot ride the roller coaster”  r is “You are under four feet tall”  s is “You are older than 16 years old” (r   s)  q

UMBC CMSC 203, Section Fall Ex Consistency System specification:  “The diagnostic message is stored in the buffer or it is retransmitted.”  “The diagnostic message is not stored in the buffer.”  “If the diagnostic message is stored in the buffer, then it is retransmitted.” p is “The diagnostic message is stored in the buffer” q is “The diagnostic message is retransmitted” Specification:  p  q   p  p  q

UMBC CMSC 203, Section Fall Logical Equivalences Tables 5, 6, 7 in the Text (pg. 24)  Identity, domination, idempotent, double negation, commutative, association, distributive, absorption, negation De Morgan’s Laws   (p  q)   p   q   (p  q)   p   q Implications  p  q   p  q Biconditional  p  q  (p  q)  (q  p)

UMBC CMSC 203, Section Fall Ex – Constructing Equivalences (p  q)  (p  q)   (p  q)  (p  q) (by implication)  (  p   q)  (p  q) (by De Morgan)  (  p  p)  (  q  q) (by assoc. and commutative)  T  T  T Show that (p  q)  (p  q) is a tautology.