Week #2 – 4/6 September 2002 Prof. Marie desJardins

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

Rosen 1.3 Propositional Functions Propositional functions (or predicates) are propositions that contain variables. Ex: Let P(x) denote x > 3 P(x) has.

Union Definition: The union of sets A and B, denoted by A B, contains those elements that are in A or B or both: Example: { 1, 2, 3} {3, 4, 5} = { 1,

CS 285- Discrete Mathematics

Prof. Johnnie Baker Module Basic Structures: Sets

Basic Structures: Sets, Functions, Sequences, Sums, and Matrices

Discrete Structures & Algorithms Basics of Set Theory EECE 320 — UBC.

Basic Structures: Sets, Functions, Sequences, Sums, and Matrices

RMIT University; Taylor's College This is a story about four people named Everybody, Somebody, Anybody and Nobody. There was an important job to be done.

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.

1 Discussion #21 Discussion #21 Sets & Set Operations; Tuples & Relations.

Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.

Operations on Sets – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Operations on Sets Reading: Kolman, Section 1.2.

2.1 – Sets. Examples: Set-Builder Notation Using Set-Builder Notation to Make Domains Explicit Examples.

Logical Equivalence & Predicate Logic

Course Outline Book: Discrete Mathematics by K. P. Bogart Topics:

A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,

Michaelmas Term 2004 Discrete Mathematics CSC 141 Discrete Mathematics Dr. Corina Sas and Ms. Nelly Bencomo

CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)

Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.

Discrete Structure Sets. 2 Set Theory Set: Collection of objects (“elements”) a  A “a is an element of A” “a is a member of A” a  A “a is not an element.

January 30, 2002Applied Discrete Mathematics Week 1: Logic and Sets 1 Let’s Talk About Logic Logic is a system based on propositions.Logic is a system.

1. Set Theory Set: Collection of objects (“elements”) a  A “a is an element of A” “a is a member of A” a  A “a is not an element of A” A = {a 1, a 2,

September1999 CMSC 203 / 0201 Fall 2002 Week #1 – 28/30 August 2002 Prof. Marie desJardins.

CompSci 102 Discrete Math for Computer Science

Thinking Mathematically Chapter 2 Set Theory 2.1 Basic Set Concepts.

Nested Quantifiers Section 1.5.

Discrete Mathematical Structures 4 th Edition Kolman, Busby, Ross © 2000 by Prentice-Hall, Inc. ISBN

Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 Basic Structure : Sets, Functions, Sequences, and Sums Sets Operations.

Chapter 2 With Question/Answer Animations. Section 2.1.

Introduction to Set theory. Ways of Describing Sets.

Discrete Mathematics CS 2610 January 27, part 2.

Discrete Mathematics Set.

Module #3 - Sets 3/2/2016(c) , Michael P. Frank 2. Sets and Set Operations.

Section 1.5. Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements.

Thinking Mathematically Venn Diagrams and Set Operations.

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.

Introduction to Set Theory (§1.6) A set is a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different)

DISCRETE COMPUTATIONAL STRUCTURES CSE 2353 Fall 2010 Most slides modified from Discrete Mathematical Structures: Theory and Applications by D.S. Malik.

Set Operators Goals Show how set identities are established

Lecture 6 Set Theory.

Applied Discrete Mathematics Week 1: Logic and Sets

Set Definition: A set is unordered collection of objects.

CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS

Discrete Structures – CNS 2300

Discrete Mathematical The Set Theory

CSNB 143 Discrete Mathematical Structures

CSE15 Discrete Mathematics 01/23/17

Set, Combinatorics, Probability & Number Theory

Sets Section 2.1.

Chapter 1 Logic and Proofs Homework 2 Given the statement “A valid password is necessary for you to log on to the campus server.” Express the statement.

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from “Discrete.

… and now for something completely different…

Exercises Show that (P  Q)  (P)  (Q)

The Foundations: Logic and Proofs

CS100: Discrete structures

Set Operations Section 2.2.

Propositional Logic Defining Propositional Logic

이산 수학 Discrete Mathematics

Nested Quantifiers Nested quantifiers are often necessary to express the meaning of sentences in English as well as important concepts in computer science.

A Brief Summary for Exam 1

Discrete Mathematics R. Johnsonbaugh

Lecture 1.3: Predicate Logic

… and now for something completely different…

Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.

CSC102 - Discrete Structures (Discrete Mathematics) Set Operations

Introduction to Computational Linguistics

Lecture 1.3: Predicate Logic

Presentation transcript:

Week #2 – 4/6 September 2002 Prof. Marie desJardins CMSC 203 / 0201 Fall 2002 Week #2 – 4/6 September 2002 Prof. Marie desJardins

TOPICS Predicate logic and quantifiers Sets and set operations

WED 9/4 PREDICATES AND QUANTIFIERS (1.3) ** Homework #0 due today! **

CONCEPTS / VOCABULARY Predicate (a.k.a. propositional function) Arguments (n-tuple) Universe of discourse, syntax vs. semantics Universal quantification  Existential quantification  Nesting of quantifiers Binding variables, propositions Negated quantifiers / equivalences

Examples H(x) = Happy(x). Which are equivalent? Negations? x H(x) x H(x) x H(x) x H(x) x H(x) x H(x) Compare and contrast: x y Likes (x,y) x y Likes (x,y) x y Likes (x,y) x y Likes (x,y)

Examples II Exercise 1.3.11: use L(x,y) (“x loves y”) to express: Everybody loves Jerry. Everybody loves somebody. There is somebody whom everybody loves. Nobody loves everybody. There is somebody whom Lydia does not love. There is somebody whom no one loves. There is exactly one person whom everybody loves. There are exactly two people whom Lynn loves. Everyone loves himself or herself. There is someone who loves no one besides himself or herself.

Examples III Exercise 1.3.35: Show that the statements x y P(x,y) and x y P(x,y) have the same truth value. Exercise 1.3.39: Establish the following equivalences: (x P(x))  A  x (P(x)  A) (x P(x))  A  x (P(x)  A)

An additional exercise Consistency: Exercise 1.1.35: Are the following specifications consistent? Definition of consistency: A set of propositions is consistent if there is an assignment of truth values to the variables that makes each expression true. “The system is in multiuser state if and only if it is operating normally. If the system is operating normally, the kernel is functioning. The kernel is not functioning or the system is in interrupt mode. If the system is not in multiuser state, then it is in interrupt mode. The system is not in interrupt mode.”

FRI 9/6 SETS AND SET OPERATIONS (1.4-1.5)

CONCEPTS / VOCABULARY Sets, elements, members N, Z, Z+, R Set equality Intensional (set builder) vs. extensional (enumerated) set definitions Universal set Empty/null set (), subset, proper subset, power set Infinite sets, finite sets, cardinality Ordered n-tuples, Cartesian product

CONCEPTS / VOCABULARY Venn diagram Union, intersection, difference (complement), symmetric difference Disjoint sets Principle of inclusion-exclusion Set identities (Table 1.5.1: identity, domination, idempotent, complementation, commutative, associative, distributive, and De Morgan’s laws)

Examples Exercise 1.4.23: How many different elements does A x B have if A has m elements and B has n elements? Example 1.5.10: Prove that A  B = A  B. Exercise 1.5.15: Let A, B, and C be sets. Show that (a) A  (B  C) = (A  B)  C (c) A  (B  C) = (A  B)  (A  C)

Examples II Exercise 1.5.19: What can you say about the sets A and B if the following are true? A  B = A A  B = A A – B = A A  B = B  A A – B = B – A

Examples III Exercise 1.5.23: Find the symmetric difference of the set of computer science majors at a school and the set of mathematics majors at this school. Exercise 1.5.39: Using the universal set U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, find the set specified by each of the following bit strings: 11 1100 1111 01 0111 1000 10 0000 0001