Copyright 2004-2006 Curt Hill Euler Circles With Venn Diagrams Thrown in for Good Measure.

Slides:



Advertisements
Similar presentations
Set Operations. When sets are equal A equals B iff for all x, x is in A iff x is in B or … and this is what we do to prove sets equal.
Advertisements

 Union  Intersection  Relative Complement  Absolute Complement Likened to Logical Or and Logical And Likened to logical Negation.
PROOF BY CONTRADICTION
Review for CS1050. Review Questions Without using truth tables, prove that  (p  q)   q is a tautology. Prove that the sum of an even integer and an.
Copyright © Cengage Learning. All rights reserved.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Instructor: Hayk Melikya
(CSC 102) Discrete Structures Lecture 14.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
IB Math Studies – Topic 3. IB Course Guide Description.
1 Section 1.7 Set Operations. 2 Union The union of 2 sets A and B is the set containing elements found either in A, or in B, or in both The denotation.
Sets 1.
Sets 1.
1 CSE 20: Lecture 7 Boolean Algebra CK Cheng 4/21/2011.
Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.
Adapted from Discrete Math
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 2.3, Slide 1 Set Theory 2 Using Mathematics to Classify Objects.
Venn Diagrams/Set Theory   Venn Diagram- A picture that illustrates the relationships between two or more sets { } are often used to denote members of.
1.1 Sets and Logic Set – a collection of objects. Set brackets {} are used to enclose the elements of a set. Example: {1, 2, 5, 9} Elements – objects inside.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Formal Theories SIE 550 Lecture Matt Dube Doctoral Student - Spatial.
Course Outline Book: Discrete Mathematics by K. P. Bogart Topics:
Logical Circuit Design Week 5: Combinational Logic Circuits Mentor Hamiti, MSc Office ,
Copyright © Curt Hill Truth Tables A way to show Boolean Operations.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
Chapter 3 – Set Theory  .
Copyright © Curt Hill BitWise Operators Packing Logicals with Other Bases as a Bonus.
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7.1 – 7.2 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Boolean.
Copyright © 2014 Curt Hill Set Operations Now it gets fun.
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
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.
1 ENM 503 Block 1 Algebraic Systems Lesson 2 – The Algebra of Sets The Essence of Sets What are they?
THE NATURE OF SETS Copyright © Cengage Learning. All rights reserved. 2.
DISCRETE COMPUTATIONAL STRUCTURES
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
CS201: Data Structures and Discrete Mathematics I
CompSci 102 Discrete Math for Computer Science
1 Introduction to Abstract Mathematics Sets Section 2.1 Basic Notions of Sets Section 2.2 Operations with sets Section 2.3 Indexed Sets Instructor: Hayk.
Venn Diagrams Truth Sets & Valid Arguments Truth Sets & Valid Arguments Truth Tables Implications Truth Tables Implications Truth Tables Converse, Inverse,
2.1 Sets 2.2 Set Operations –Set Operations –Venn Diagrams –Set Identities –Union and Intersection of Indexed Collections 2.3 Functions 2.4 Sequences and.
Chapter 2 With Question/Answer Animations. Section 2.1.
Copyright © Curt Hill Proofs An Introduction.
Chapter 2 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Propositional Equivalence A needed step towards proofs Copyright © 2014 Curt Hill.
Copyright © Curt Hill Minimization Arbitrary Truth Table to Minimal Function.
Set Operations Section 2.2.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 2.3 Venn Diagrams and Set Operations.
Discrete Mathematics Lecture # 10 Venn Diagram. Union  Let A and B be subsets of a universal set U. The union of sets A and B is the set of all elements.
Section 1.2 – 1.3 Outline Intersection  Disjoint Sets (A  B=  ) AND Union  OR Universe The set of items that are possible for membership Venn Diagrams.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
DISCRETE COMPUTATIONAL STRUCTURES CSE 2353 Fall 2010 Most slides modified from Discrete Mathematical Structures: Theory and Applications by D.S. Malik.
 Conjunctive Normal Form: A logic form must satisfy one of the following conditions 1) It must be a single variable (A) 2) It must be the negation of.
Set Operators Goals Show how set identities are established
Chapter 1 Logic and Proof.
Chapter 2 Sets and Functions.
DISCRETE MATHEMATICS CHAPTER I.
Chapter 5, Set Theory 1.
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from “Discrete.
Set Operations Section 2.2.
Information Technology Department
A Brief Summary for Exam 1
More axioms Disjunction Copyright © 2007 Curt Hill.
Inequalities in Geometry
Foundations of Discrete Mathematics
Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.
Digital Systems Section 3 Boolean Algebra. Digital Systems Section 3 Boolean Algebra.
Presentation transcript:

Copyright Curt Hill Euler Circles With Venn Diagrams Thrown in for Good Measure

Copyright Curt Hill Venn Diagrams Leonhard Euler ( ) used them first They are more commonly associated with John Venn ( ) Since Euler’s place in mathematical history is not in question, we will use Venn’s for the name

Copyright Curt Hill Boolean Algebra and Set Theory are isomorphic This means that any theorem in one (and its proof) can be transformed into the other Variables in Boolean algebra convert to membership in a set Unions are Ors Intersections are Ands Complement is Negation All other operators in one have corresponding operators in another

Copyright Curt Hill Venn Diagram Example

Copyright Curt Hill Discussion The interior of the circle represents: –Members of the set –The variable true The exterior is: –Non-members of the set –The variable false The rectangle is –The universe of discourse –The variables being considered

Copyright Curt Hill Second Example

Copyright Curt Hill Discussion In two circles there are four areas 0 – not a member of either 1 – member of first but not the second 2 – member of the second but not the first 3 – member of both Of course, this numbering is completely arbitrary

Copyright Curt Hill Another View There are also four ways to draw the circles –Overlapping –Two disjoint –Two identical circles –One circle contained in another These carry interpretation about the contents (or lack of contents) of areas 1-3 –This allows for some of the areas to be void

Copyright Curt Hill Third Example Disjoint, 3 is empty Contained, 2 is empty Normal, 4 areas

Copyright Curt Hill Venn Diagram for Boolean Algebra One circle gives two areas –p–p –¬p If p is a constant true or false –One of areas is void

Copyright Curt Hill Fourth Example p ¬p¬p

Copyright Curt Hill Fifth Example 1 p  ¬q 2 q  ¬p 3 q  p 0 ¬q  ¬p

Copyright Curt Hill Boolean interpretation All combinations of areas have a construction –3 – p  q –1,2,3 – p  q –0,2,3 – p  q –0,3 – p  q

Copyright Curt Hill Diagram proofs Generate the diagrams for each side of an equivalence A tautology should have identical coloring –A contradiction should be different Venn diagrams provide a proof that is more graphic than truth tables –Yet less convincing than what we would like

Copyright Curt Hill Prove p  ¬(q  p) The proof using Venn diagrams proceeds somewhat like that of a truth table Start with small pieces Build up from there Start with p  q

Copyright Curt Hill q  p qp

Copyright Curt Hill ¬( q  p) qp

Copyright Curt Hill p  ¬( q  p) qp

Copyright Curt Hill Another Proof Disprove –p  q ≡ q  p This is known as affirming the antecedent –Common logical fallacy An implication –If it is Thursday at 2 then I teach logic The fallacy –I am teaching logic, so it must be Thursday at 2.

Copyright Curt Hill p  q qp q p q

Copyright Curt Hill q  p qp p q p

Copyright Curt Hill Do these look the same to you? p  q and q  p are not equivalent