CSE20: Discrete Mathematics
|
|
- Bethanie Hampton
- 5 years ago
- Views:
Transcription
1 Spring 2018
2 Summary Last time: Today: Introduction to Basic Set Theory (Vardy) More on sets Connections between sets and logic Reading: Chapter 2
3 Set Notation A, B, C: sets A = {1, 2, 3}: finite set with elements 1, 2, 3 2 A: set membership relation ( 2 is in A ) A B, A B: set inclusion relations A B, A B: set operations (intersection, union, etc.)
4 Set Notation A, B, C: sets A = {1, 2, 3}: finite set with elements 1, 2, 3 2 A: set membership relation ( 2 is in A ) A B, A B: set inclusion relations A B, A B: set operations (intersection, union, etc.) Let A = {1, 2, 3} and B = {2, 3} Question: The statement 5 A is (A) Correct; (B) Wrong; (C) True; (D) None of the above
5 Set Notation A, B, C: sets A = {1, 2, 3}: finite set with elements 1, 2, 3 2 A: set membership relation ( 2 is in A ) A B, A B: set inclusion relations A B, A B: set operations (intersection, union, etc.) Let A = {1, 2, 3} and B = {2, 3} Question: The statement 5 A is (A) Correct; (B) Wrong; (C) True; (D) None of the above Question: The statement B A is (A) Correct; (B) Wrong; (C) True; (D) None of the above
6 Typecheck your math! A, B, C: sets
7 Typecheck your math! A, B, C: sets x, y, z: elements
8 Typecheck your math! A, B, C: sets x, y, z: elements (x A), (y / B): propositions, (true or false)
9 Typecheck your math! A, B, C: sets x, y, z: elements (x A), (y / B): propositions, (true or false) (A B), (B = C): propositions (true or false)
10 Typecheck your math! A, B, C: sets x, y, z: elements (x A), (y / B): propositions, (true or false) (A B), (B = C): propositions (true or false) Compound statements:
11 Typecheck your math! A, B, C: sets x, y, z: elements (x A), (y / B): propositions, (true or false) (A B), (B = C): propositions (true or false) Compound statements: (x A) (A B): true or false
12 Typecheck your math! A, B, C: sets x, y, z: elements (x A), (y / B): propositions, (true or false) (A B), (B = C): propositions (true or false) Compound statements: (x A) (A B): true or false A B, A B: sets (result of a set operation)
13 Typecheck your math! A, B, C: sets x, y, z: elements (x A), (y / B): propositions, (true or false) (A B), (B = C): propositions (true or false) Compound statements: (x A) (A B): true or false A B, A B: sets (result of a set operation) (A B) (x / C)
14 Typecheck your math! A, B, C: sets x, y, z: elements (x A), (y / B): propositions, (true or false) (A B), (B = C): propositions (true or false) Compound statements: (x A) (A B): true or false A B, A B: sets (result of a set operation) (A B) (x / C) nonsense: (A B) is a set, not a proposition.
15 Typecheck your math! A, B, C: sets x, y, z: elements (x A), (y / B): propositions, (true or false) (A B), (B = C): propositions (true or false) Compound statements: (x A) (A B): true or false A B, A B: sets (result of a set operation) (A B) (x / C) nonsense: (A B) is a set, not a proposition. A x, A B
16 Typecheck your math! A, B, C: sets x, y, z: elements (x A), (y / B): propositions, (true or false) (A B), (B = C): propositions (true or false) Compound statements: (x A) (A B): true or false A B, A B: sets (result of a set operation) (A B) (x / C) nonsense: (A B) is a set, not a proposition. A x, A B nonsense, unless x is a set, of B is a set of sets
17 Quiz Time Let A, B, C be sets (of numbers), x, y, z (numerical) values, and P(x), Q(x) predicates. Which of the following expressions are meaningful? (choose the best possible answer.) 1. (x A) (A B) 2. (A B) {x} 3. {x, y} (A B) 4. {x} (A B) 5. x.(x A) (x B) 6. A, B, C.(A B) (B C) (A C) 7. ({x : P(x)} {y : Q(y)}) ( x.p(x) Q(x)) (A) 1,2,3,6,7; (B) 1,2,3,4,5; (C) 1,2,3,5,6,7; (D) 1,3,5,6,7;
18 Set vs Predicates Each set A defines a corresponding predicate: set membership predicate P(x) = (x A)
19 Set vs Predicates Each set A defines a corresponding predicate: set membership predicate P(x) = (x A) Each predicate Q defines a corresponding set: the set of all values satisfying the predicate B = {x Q(x)}
20 Set vs Predicates Each set A defines a corresponding predicate: set membership predicate P(x) = (x A) Each predicate Q defines a corresponding set: the set of all values satisfying the predicate B = {x Q(x)} Notice: for any set A and predicate P If Q(x) = (x A), and B = {x : Q(x)}, then A = B If B = {x : P(x)} and Q(x) = (x B), then P(x) = Q(x), i.e., x.p(x) Q(x).
21 Set operations vs Logican operations A = {x : P(x)} B = {x : Q(x)} C = {x : R(x)}
22 Set operations vs Logican operations A = {x : P(x)} B = {x : Q(x)} C = {x : R(x)} A B = {x : P(x) Q(x)} A B = {x : P(x) Q(x)} A \ B = A B = {x : P(x) Q(x)} A c = A = {x : P(x)}
23 Set operations vs Logican operations A = {x : P(x)} B = {x : Q(x)} C = {x : R(x)} A B = {x : P(x) Q(x)} A B = {x : P(x) Q(x)} A \ B = A B = {x : P(x) Q(x)} A c = A = {x : P(x)} (A B) C = {x : (P(x) Q(x)) R(x)} ((x A) (x B) (x C)) (x (A B) C)
24 Quantifying over a set Quantification over the universe of discourse U: x.p(x) : P(x) is true for all x in U x.p(x) : P(x) is true for some x in U Universe U usually implicit, but clear from the context
25 Quantifying over a set Quantification over the universe of discourse U: x.p(x) : P(x) is true for all x in U x.p(x) : P(x) is true for some x in U Universe U usually implicit, but clear from the context Can use set notation to quantify over a specific set: x S.P(x) : P(x) is true for all x in set S x S.P(x) : P(x) is true for some x in set S Examples: 1. x Z. y Z.x + y = 0 2. x Q.x 2 = 2 3. x R.x 2 = 2
26 Quantifying over a set using logical connectives Which of the following logical statements corresponds to x S.P(x)? (A) x.((x S) P(x))) (B) x.((x S) P(x))) (C) x.((x S) P(x))) (D) x.(p(x) (x S))
27 Quantifying over a set using logical connectives Which of the following logical statements corresponds to x S.P(x)? (A) x.((x S) P(x))) (B) x.((x S) P(x))) (C) x.((x S) P(x))) (D) x.(p(x) (x S)) Which of the following logical statements corresponds to x S.P(x)? (A) x.((x S) P(x))) (B) x.((x S) P(x))) (C) x.((x S) P(x))) (D) x.(p(x) (x S))
28 Negating quantifiers over a set Which of the following statements is equivalent to ( x S.P(x))? (A) x S c. P(x) (B) x S c. P(x) (C) x S.P(x) (D) x S. P(x)
29 Negating quantifiers over a set Which of the following statements is equivalent to ( x S.P(x))? (A) x S c. P(x) (B) x S c. P(x) (C) x S.P(x) (D) x S. P(x) Which of the following statements is equivalent to ( x S.P(x))? (A) x S c. P(x) (B) x S c. P(x) (C) x S.P(x) (D) x S. P(x)
30 Let s use the definitions! Recall the definitions x S.P(x) x.((x S) P(x)) x S.P(x) x.((x S) P(x)). Then we have the following chain of equivalences: ( x S.P(x))
31 Let s use the definitions! Recall the definitions x S.P(x) x.((x S) P(x)) x S.P(x) x.((x S) P(x)). Then we have the following chain of equivalences: ( x S.P(x)) ( x.((x S) P(x)))
32 Let s use the definitions! Recall the definitions x S.P(x) x.((x S) P(x)) x S.P(x) x.((x S) P(x)). Then we have the following chain of equivalences: ( x S.P(x)) ( x.((x S) P(x))) x. ((x S) P(x)))
33 Let s use the definitions! Recall the definitions x S.P(x) x.((x S) P(x)) x S.P(x) x.((x S) P(x)). Then we have the following chain of equivalences: ( x S.P(x)) ( x.((x S) P(x))) x. ((x S) P(x))) x.( (x S) P(x))
34 Let s use the definitions! Recall the definitions x S.P(x) x.((x S) P(x)) x S.P(x) x.((x S) P(x)). Then we have the following chain of equivalences: ( x S.P(x)) ( x.((x S) P(x))) x. ((x S) P(x))) x.( (x S) P(x)) x.((x S) P(x))
35 Let s use the definitions! Recall the definitions x S.P(x) x.((x S) P(x)) x S.P(x) x.((x S) P(x)). Then we have the following chain of equivalences: ( x S.P(x)) ( x.((x S) P(x))) x. ((x S) P(x))) x.( (x S) P(x)) x.((x S) P(x)) x S. P(x))
36 Let s use the definitions! Recall the definitions x S.P(x) x.((x S) P(x)) x S.P(x) x.((x S) P(x)). Then we have the following chain of equivalences: ( x S.P(x))
37 Let s use the definitions! Recall the definitions x S.P(x) x.((x S) P(x)) x S.P(x) x.((x S) P(x)). Then we have the following chain of equivalences: ( x S.P(x)) ( x.((x S) P(x)))
38 Let s use the definitions! Recall the definitions x S.P(x) x.((x S) P(x)) x S.P(x) x.((x S) P(x)). Then we have the following chain of equivalences: ( x S.P(x)) ( x.((x S) P(x))) x. ((x S) P(x)))
39 Let s use the definitions! Recall the definitions x S.P(x) x.((x S) P(x)) x S.P(x) x.((x S) P(x)). Then we have the following chain of equivalences: ( x S.P(x)) ( x.((x S) P(x))) x. ((x S) P(x))) x. ( (x S) P(x))
40 Let s use the definitions! Recall the definitions x S.P(x) x.((x S) P(x)) x S.P(x) x.((x S) P(x)). Then we have the following chain of equivalences: ( x S.P(x)) ( x.((x S) P(x))) x. ((x S) P(x))) x. ( (x S) P(x)) x.( (x S) P(x))
41 Let s use the definitions! Recall the definitions x S.P(x) x.((x S) P(x)) x S.P(x) x.((x S) P(x)). Then we have the following chain of equivalences: ( x S.P(x)) ( x.((x S) P(x))) x. ((x S) P(x))) x. ( (x S) P(x)) x.( (x S) P(x)) x.((x S) P(x))
42 Let s use the definitions! Recall the definitions x S.P(x) x.((x S) P(x)) x S.P(x) x.((x S) P(x)). Then we have the following chain of equivalences: ( x S.P(x)) ( x.((x S) P(x))) x. ((x S) P(x))) x. ( (x S) P(x)) x.( (x S) P(x)) x.((x S) P(x)) x S. P(x))
43 Existentially quantifying over an empty set x.p(x) (A) True; (B) False; (C) Depends on P; (D) Undefined.
44 Existentially quantifying over an empty set x.p(x) (A) True; (B) False; (C) Depends on P; (D) Undefined. x.p(x)
45 Existentially quantifying over an empty set x.p(x) (A) True; (B) False; (C) Depends on P; (D) Undefined. x.p(x) x.((x ) P(x))
46 Existentially quantifying over an empty set x.p(x) (A) True; (B) False; (C) Depends on P; (D) Undefined. x.p(x) x.((x ) P(x)) x.(false P(x))
47 Existentially quantifying over an empty set x.p(x) (A) True; (B) False; (C) Depends on P; (D) Undefined. x.p(x) x.((x ) P(x)) x.(false P(x)) x.false
48 Existentially quantifying over an empty set x.p(x) (A) True; (B) False; (C) Depends on P; (D) Undefined. x.p(x) x.((x ) P(x)) x.(false P(x)) x.false False
49 Universally quantifying over an empty set x.p(x) (A) True; (B) False; (C) Depends on P; (D) Undefined.
50 Universally quantifying over an empty set x.p(x) (A) True; (B) False; (C) Depends on P; (D) Undefined. This is the negation of x. P(x) False. x.p(x)
51 Universally quantifying over an empty set x.p(x) (A) True; (B) False; (C) Depends on P; (D) Undefined. This is the negation of x. P(x) False. x.p(x) x.((x ) P(x))
52 Universally quantifying over an empty set x.p(x) (A) True; (B) False; (C) Depends on P; (D) Undefined. This is the negation of x. P(x) False. x.p(x) x.((x ) P(x)) x.(false P(x))
53 Universally quantifying over an empty set x.p(x) (A) True; (B) False; (C) Depends on P; (D) Undefined. This is the negation of x. P(x) False. x.p(x) x.((x ) P(x)) x.(false P(x)) x.true
54 Universally quantifying over an empty set x.p(x) (A) True; (B) False; (C) Depends on P; (D) Undefined. This is the negation of x. P(x) False. x.p(x) x.((x ) P(x)) x.(false P(x)) x.true True
55 Union and Intersection of set families Let A be a collection of sets The union of all sets in A is X = {v : X A.v X} X A
56 Union and Intersection of set families Let A be a collection of sets The union of all sets in A is X = {v : X A.v X} X A The intersection of all sets in A is X = {v : X A.v X} X A
57 Union and Intersection of set families Let A be a collection of sets The union of all sets in A is X = {v : X A.v X} X A The intersection of all sets in A is X = {v : X A.v X} X A Empty unions and intersections: If A =, then X A X = X A X = U
58 Counting Subsets Powerset of a set A P(A) = 2 A = {B : B A} Example: P({1, 2, 3}) = {, {1}, {2}, {3}, {1, 2, }, {1, 3}, {2, 3}, {1, 2, 3}}. What s the size of P(A)? For every element x A, there are two possibilities (x A or x / A) A subset of A can be selected in 2 A possible ways If A = n, then A has 2 n possible subsets Ok, so P(A) = 2 A. But how many subsets of A have size 3?
59 Binomial Coefficients The Binomial Coefficient ( n k) expresses the number of subsets of a set of n, that have size precisely k. ( ) n = k ( ) n = 1 n ( ) n = 1 0 ( ) n = n 1 ( ) n 1 + k 1 ( ) n 1 k
CSC Discrete Math I, Spring Sets
CSC 125 - Discrete Math I, Spring 2017 Sets Sets A set is well-defined, unordered collection of objects The objects in a set are called the elements, or members, of the set A set is said to contain its
More informationCMPSCI 250: Introduction to Computation. Lecture #7: Quantifiers and Languages 6 February 2012
CMPSCI 250: Introduction to Computation Lecture #7: Quantifiers and Languages 6 February 2012 Quantifiers and Languages Quantifier Definitions Translating Quantifiers Types and the Universe of Discourse
More information9/19/12. Why Study Discrete Math? What is discrete? Sets (Rosen, Chapter 2) can be described by discrete math TOPICS
What is discrete? Sets (Rosen, Chapter 2) TOPICS Discrete math Set Definition Set Operations Tuples Consisting of distinct or unconnected elements, not continuous (calculus) Helps us in Computer Science
More informationCSL105: Discrete Mathematical Structures. Ragesh Jaiswal, CSE, IIT Delhi
is another way of showing that an argument is correct. Definitions: Literal: A variable or a negation of a variable is called a literal. Sum and Product: A disjunction of literals is called a sum and a
More informationSection 2.2: Introduction to the Logic of Quantified Statements
Section 2.2: Introduction to the Logic of Quantified Statements In this section, we shall continue to examine some of the fundamentals of predicate calculus. Specifically, we shall look at the negations
More informationOverview. CS389L: Automated Logical Reasoning. Lecture 6: First Order Logic Syntax and Semantics. Constants in First-Order Logic.
Overview CS389L: Automated Logical Reasoning Lecture 6: First Order Logic Syntax and Semantics Işıl Dillig So far: Automated reasoning in propositional logic. Propositional logic is simple and easy to
More informationChapter 3. Set Theory. 3.1 What is a Set?
Chapter 3 Set Theory 3.1 What is a Set? A set is a well-defined collection of objects called elements or members of the set. Here, well-defined means accurately and unambiguously stated or described. Any
More information1.1 - Introduction to Sets
1.1 - Introduction to Sets Math 166-502 Blake Boudreaux Department of Mathematics Texas A&M University January 18, 2018 Blake Boudreaux (Texas A&M University) 1.1 - Introduction to Sets January 18, 2018
More information2.1 Sets 2.2 Set Operations
CSC2510 Theoretical Foundations of Computer Science 2.1 Sets 2.2 Set Operations Introduction to Set Theory A set is a structure, representing an unordered collection (group, plurality) of zero or more
More informationLecture 1: Conjunctive Queries
CS 784: Foundations of Data Management Spring 2017 Instructor: Paris Koutris Lecture 1: Conjunctive Queries A database schema R is a set of relations: we will typically use the symbols R, S, T,... to denote
More informationToday s Topics. What is a set?
Today s Topics Introduction to set theory What is a set? Set notation Basic set operations What is a set? Definition: A set is an unordered collection of objects Examples: Sets can contain items of mixed
More informationCPSC 121: Models of Computation. Module 6: Rewriting predicate logic statements
CPSC 121: Models of Computation Module 6: Rewriting predicate logic statements Module 6: Rewriting predicate logic statements Pre-class quiz #7 is due March 1st at 19:00. Assigned reading for the quiz:
More information1 of 7 7/15/2009 3:40 PM Virtual Laboratories > 1. Foundations > 1 2 3 4 5 6 7 8 9 1. Sets Poincaré's quote, on the title page of this chapter could not be more wrong (what was he thinking?). Set theory
More informationCS Bootcamp Boolean Logic Autumn 2015 A B A B T T T T F F F T F F F F T T T T F T F T T F F F
1 Logical Operations 1.1 And The and operator is a binary operator, denoted as, &,, or sometimes by just concatenating symbols, is true only if both parameters are true. A B A B F T F F F F The expression
More informationChapter 1.3 Quantifiers, Predicates, and Validity. Reading: 1.3 Next Class: 1.4. Motivation
Chapter 1.3 Quantifiers, Predicates, and Validity Reading: 1.3 Next Class: 1.4 1 Motivation Propositional logic allows to translate and prove certain arguments from natural language If John s wallet was
More informationWhat is Set? Set Theory. Notation. Venn Diagram
What is Set? Set Theory Peter Lo Set is any well-defined list, collection, or class of objects. The objects in set can be anything These objects are called the Elements or Members of the set. CS218 Peter
More informationQuery formalisms for relational model relational calculus
lecture 7: Query formalisms for relational model relational calculus course: Database Systems (NDBI025) doc. RNDr. Tomáš Skopal, Ph.D. SS2011/12 Department of Software Engineering, Faculty of Mathematics
More informationNotes. Notes. Introduction. Notes. Propositional Functions. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry.
Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 1 / 1 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.3 1.4 of Rosen cse235@cse.unl.edu Introduction
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Final exam The final exam is Saturday December 16 11:30am-2:30pm. Lecture A will take the exam in Lecture B will take the exam
More informationLECTURE 8: SETS. Software Engineering Mike Wooldridge
LECTURE 8: SETS Mike Wooldridge 1 What is a Set? The concept of a set is used throughout mathematics; its formal definition matches closely our intuitive understanding of the word. Definition: A set is
More information2.2 Set Operations. Introduction DEFINITION 1. EXAMPLE 1 The union of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 2, 3, 5}; that is, EXAMPLE 2
2.2 Set Operations 127 2.2 Set Operations Introduction Two, or more, sets can be combined in many different ways. For instance, starting with the set of mathematics majors at your school and the set of
More informationSets MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Sets Fall / 31
Sets MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Sets Fall 2014 1 / 31 Outline 1 Sets Introduction Cartesian Products Subsets Power Sets Union, Intersection, Difference
More informationRange Restriction for General Formulas
Range Restriction for General Formulas 1 Range Restriction for General Formulas Stefan Brass Martin-Luther-Universität Halle-Wittenberg Germany Range Restriction for General Formulas 2 Motivation Deductive
More informationHomework 1. Due Date: Wednesday 11/26/07 - at the beginning of the lecture
Homework 1 Due Date: Wednesday 11/26/07 - at the beginning of the lecture Problems marked with a [*] are a littlebit harder and count as extra credit. Note 1. For any of the given problems make sure that
More informationCSC 501 Semantics of Programming Languages
CSC 501 Semantics of Programming Languages Subtitle: An Introduction to Formal Methods. Instructor: Dr. Lutz Hamel Email: hamel@cs.uri.edu Office: Tyler, Rm 251 Books There are no required books in this
More informationPractice Problems: All Computer Science majors are people. Some computer science majors are logical thinkers. Some people are logical thinkers.
CSE 240, Fall, 2013 Homework 2 Due, Tuesday September 17. Can turn in class, at the beginning of class, or earlier in the mailbox labelled Pless in Bryan Hall, room 509c. Practice Problems: 1. Consider
More informationLecture 5: Predicate Calculus. ffl Predicate Logic ffl The Language ffl Semantics: Structures
Lecture 5: Predicate Calculus ffl Predicate Logic ffl The Language ffl Semantics: Structures 1 Why Predicate Logic? Propositional logic is not powerful enough to express statements such as ffl For every
More informationFirst Order Predicate Logic CIS 32
First Order Predicate Logic CIS 32 Functionalia Demos? HW 3 is out on the web-page. Today: Predicate Logic Constructing the Logical Agent Predicate Logic First-order predicate logic More expressive than
More informationlogic with quantifiers (informally)
EDAA40 Discrete Structures in Computer Science 8: Quantificational logic Jörn W. Janneck, Dept. of Computer Science, Lund University logic with quantifiers (informally) Given a logical formula that depends
More information[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics
400 lecture note #4 [Ch 6] Set Theory 1. Basic Concepts and Definitions 1) Basics Element: ; A is a set consisting of elements x which is in a/another set S such that P(x) is true. Empty set: notated {
More informationFormal Specification: Z Notation. CITS5501 Software Testing and Quality Assurance
Formal Specification: Z Notation CITS5501 Software Testing and Quality Assurance The Zed Notation, J.M.Spivey. Semester 1, 2017 A Formal Specification Notation A Syntax - often based on set theory and
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Final exam The final exam is Saturday March 18 8am-11am. Lecture A will take the exam in GH 242 Lecture B will take the exam
More informationSchool of Distance Education University of Kerala M.Sc Computer Science Assignment Topics
School of Distance Education University of Kerala M.Sc Computer Science Assignment Topics 2017-2018 DCS11 Computer Architecture 1. Explain the following terms a) Memory Organization b) Memory system considerations
More informationIntroduction II. Sets. Terminology III. Definition. Definition. Definition. Example
Sets Slides by Christopher M. ourke Instructor: erthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.6 1.7 of Rosen cse235@cse.unl.edu Introduction
More informationDiscrete Mathematics Lecture 4. Harper Langston New York University
Discrete Mathematics Lecture 4 Harper Langston New York University Sequences Sequence is a set of (usually infinite number of) ordered elements: a 1, a 2,, a n, Each individual element a k is called a
More informationCS 1200 Discrete Math Math Preliminaries. A.R. Hurson 323 CS Building, Missouri S&T
CS 1200 Discrete Math A.R. Hurson 323 CS Building, Missouri S&T hurson@mst.edu 1 Course Objective: Mathematical way of thinking in order to solve problems 2 Variable: holder. A variable is simply a place
More informationThe set consisting of all natural numbers that are in A and are in B is the set f1; 3; 5g;
Chapter 5 Set Theory 5.1 Sets and Operations on Sets Preview Activity 1 (Set Operations) Before beginning this section, it would be a good idea to review sets and set notation, including the roster method
More informationSets. Mukulika Ghosh. Fall Based on slides by Dr. Hyunyoung Lee
Sets Mukulika Ghosh Fall 2018 Based on slides by Dr. Hyunyoung Lee Sets Sets A set is an unordered collection of objects, called elements, without duplication. We write a A to denote that a is an element
More informationObjectives Graph and Analyze Rational Functions Find the Domain, Asymptotes, Holes, and Intercepts of a Rational Function
SECTIONS 3.5: Rational Functions Objectives Graph and Analyze Rational Functions Find the Domain, Asymptotes, Holes, and Intercepts of a Rational Function I. Rational Functions A rational function is a
More informationCS100: DISCRETE STRUCTURES
CS: DISCRETE STRUCTURES Computer Science Department Lecture : Set and Sets Operations (Ch2) Lecture Contents 2 Sets Definition. Some Important Sets. Notation used to describe membership in sets. How to
More informationSets. Sets. Subset, universe. Specifying sets, membership. Examples: Specifying a set using a predicate. Examples
Sets 2/36 We will not give a precise definition of what is a set, but we will say precisely what you can do with it. Sets Lectures 7 and 8 (hapter 16) (Think of a set as a collection of things of which
More informationMathematics for Computer Scientists 2 (G52MC2)
Mathematics for Computer Scientists 2 (G52MC2) L07 : Operations on sets School of Computer Science University of Nottingham October 29, 2009 Enumerations We construct finite sets by enumerating a list
More informationCopyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Chapter 6 Outline. Unary Relational Operations: SELECT and
Chapter 6 The Relational Algebra and Relational Calculus Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 6 Outline Unary Relational Operations: SELECT and PROJECT Relational
More informationCSI30. Chapter 1. The Foundations: Logic and Proofs Rules of inference with quantifiers Logic and bit operations Specification consistency
Chapter 1. The Foundations: Logic and Proofs 1.13 Rules of inference with quantifiers Logic and bit operations Specification consistency 1.13 Rules of inference with quantifiers universal instantiation
More informationHigher-Order Logic. Specification and Verification with Higher-Order Logic
Higher-Order Logic Specification and Verification with Higher-Order Logic Arnd Poetzsch-Heffter (Slides by Jens Brandt) Software Technology Group Fachbereich Informatik Technische Universität Kaiserslautern
More informationA set with only one member is called a SINGLETON. A set with no members is called the EMPTY SET or 2 N
Mathematical Preliminaries Read pages 529-540 1. Set Theory 1.1 What is a set? A set is a collection of entities of any kind. It can be finite or infinite. A = {a, b, c} N = {1, 2, 3, } An entity is an
More informationLOGIC AND DISCRETE MATHEMATICS
LOGIC AND DISCRETE MATHEMATICS A Computer Science Perspective WINFRIED KARL GRASSMANN Department of Computer Science University of Saskatchewan JEAN-PAUL TREMBLAY Department of Computer Science University
More informationCPSC 121: Models of Computation. Module 5: Predicate Logic
CPSC 121: Models of Computation Module 5: Predicate Logic Module 5: Predicate Logic Midterm 1: Friday February 9 th, 17:00 to 18:15 A to C (by last name): room DMP 310 D to K: room MATH 100 L to P: room
More informationThe Specification Phase
The Specification Phase CS427: Elements of Software Engineering Lecture 4.1 10am, 30 Jan 2012 CS427 The Specification Phase 1/16 Outline 1 Recall... The Requirements Phase 2 Phase 2: Specifications 3 Requirements
More information2/18/14. Uses for Discrete Math in Computer Science. What is discrete? Why Study Discrete Math? Sets and Functions (Rosen, Sections 2.1,2.2, 2.
Why Study Discrete Math? Sets and Functions (Rosen, Sections 2.1,2.2, 2.3) TOPICS Discrete math Set Definition Set Operations Tuples Digital computers are based on discrete units of data (bits). Therefore,
More informationQuantification. Using the suggested notation, symbolize the statements expressed by the following sentences.
Quantification In this and subsequent chapters, we will develop a more formal system of dealing with categorical statements, one that will be much more flexible than traditional logic, allow a deeper analysis
More informationSets. Margaret M. Fleck. 15 September 2010
Sets Margaret M. Fleck 15 September 2010 These notes cover set notation, operations on sets, and how to prove claims involving sets (Rosen sections 2.1 and 2.2). They also cover some logic subtleties that
More informationConstraint Propagation for Efficient Inference in Markov Logic
Constraint Propagation for Efficient Inference in Tivadar Papai 1 Parag Singla 2 Henry Kautz 1 1 University of Rochester, Rochester NY 14627, USA 2 University of Texas, Austin TX 78701, USA September 13,
More informationCS314: FORMAL LANGUAGES AND AUTOMATA THEORY L. NADA ALZABEN. Lecture 1: Introduction
CS314: FORMAL LANGUAGES AND AUTOMATA THEORY L. NADA ALZABEN Lecture 1: Introduction Introduction to the course 2 Required Text Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, BY MICHAEL
More informationDISCRETE MATHEMATICS
DISCRETE MATHEMATICS WITH APPLICATIONS THIRD EDITION SUSANNA S. EPP DePaul University THOIVISON * BROOKS/COLE Australia Canada Mexico Singapore Spain United Kingdom United States CONTENTS Chapter 1 The
More informationCMSC 330: Organization of Programming Languages. Objects and Abstract Data Types
CMSC 330: Organization of Programming Languages Objects and Abstract Data Types Abstract Data Types Expose signature operators to create, combine, and observe values Hide representation & implementations
More informationfor all x, the assertion P(x) is false. there exists x, for which the assertion P(x) is true.
You can t prove a predicate is true because a predicate is not an assertion, you can t prove it is valid as it is not a deduction! If someone asks you to prove P(x), it is not totally clear what they mean.
More informationAbout the Tutorial. Audience. Prerequisites. Disclaimer& Copyright. Fuzzy Logic
About the Tutorial Fuzzy Logic resembles the human decision-making methodology and deals with vague and imprecise information. This is a very small tutorial that touches upon the very basic concepts of
More informationSummary of Course Coverage
CS-227, Discrete Structures I Spring 2006 Semester Summary of Course Coverage 1) Propositional Calculus a) Negation (logical NOT) b) Conjunction (logical AND) c) Disjunction (logical inclusive-or) d) Inequalities
More informationMath Week in Review #5. A proposition, or statement, is a declarative sentence that can be classified as either true or false, but not both.
Math 166 Fall 2006 c Heather Ramsey Page 1 Math 166 - Week in Review #5 Sections A.1 and A.2 - Propositions, Connectives, and Truth Tables A proposition, or statement, is a declarative sentence that can
More informationPlan of the lecture. G53RDB: Theory of Relational Databases Lecture 1. Textbook. Practicalities: assessment. Aims and objectives of the course
Plan of the lecture G53RDB: Theory of Relational Databases Lecture 1 Practicalities Aims and objectives of the course Plan of the course Relational model: what are relations, some terminology Relational
More informationCS 671, Automated Reasoning
CS 671, Automated Reasoning Lesson 20: Type Constructs based on Intersection (II): dependent records, abstract data types, basic algebra April 3, 2001 Last time we discussed record types and their representation
More informationOne of the main selling points of a database engine is the ability to make declarative queries---like SQL---that specify what should be done while
1 One of the main selling points of a database engine is the ability to make declarative queries---like SQL---that specify what should be done while leaving the engine to choose the best way of fulfilling
More informationSOFTWARE ENGINEERING DESIGN I
2 SOFTWARE ENGINEERING DESIGN I 3. Schemas and Theories The aim of this course is to learn how to write formal specifications of computer systems, using classical logic. The key descriptional technique
More informationAxiom 3 Z(pos(Z) X(X intersection of Z P(X)))
In this section, we are going to prove the equivalence between Axiom 3 ( the conjunction of any collection of positive properties is positive ) and Proposition 3 ( it is possible that God exists ). First,
More informationMAT121: SECTION 2.7 ANALYZING GRAPHS AND PIECEWISE FUNCTIONS
MAT121: SECTION 2.7 ANALYZING GRAPHS AND PIECEWISE FUNCTIONS SYMMETRY, EVEN, ODD A graph can be symmetric about the x-axis, y-axis, or the origin (y = x). If a mirror is placed on those lines, the graph
More informationFIPA SL Content Language Specification
1 2 3 4 5 FOUNDATION FOR INTELLIGENT PHYSICAL AGENTS FIPA SL Content Language Specification 6 7 Document title FIPA SL Content Language Specification Document number SC00008I Document source FIPA TC Communication
More informationSolutions to Selected Exercises
Chapter 1 Solutions to Selected Exercises Section 1.1 2. {2, 4} 3. {7, 10} 5. {2, 3, 5, 6, 8, 9} 6. {1, 3, 5, 7, 9, 10} 8. A 9. 11. B 12. {1, 4} 14. {1} 15. {2, 3, 4, 5, 6, 7, 8, 9, 10} 18. 1 19. 3 22.
More informationLee Pike. June 3, 2005
Proof NASA Langley Formal Methods Group lee.s.pike@nasa.gov June 3, 2005 Proof Proof Quantification Quantified formulas are declared by quantifying free variables in the formula. For example, lem1: LEMMA
More information4 Mathematical Data Types
mcs 2015/5/18 1:43 page 81 #89 4 Mathematical Data Types We have assumed that you ve already been introduced to the concepts of sets, sequences, and functions, and we ve used them informally several times
More informationFirst-Order Logic PREDICATE LOGIC. Syntax. Terms
First-Order Logic PREDICATE LOGIC Aim of this lecture: to introduce first-order predicate logic. More expressive than propositional logic. Consider the following argument: all monitors are ready; X12 is
More informationAlgebra Domains of Rational Functions
Domains of Rational Functions Rational Expressions are fractions with polynomials in both the numerator and denominator. If the rational expression is a function, it is a Rational Function. Finding the
More informationFundamentals of Discrete Mathematical Structures
Fundamentals of Discrete Mathematical Structures THIRD EDITION K.R. Chowdhary Campus Director JIET School of Engineering and Technology for Girls Jodhpur Delhi-110092 2015 FUNDAMENTALS OF DISCRETE MATHEMATICAL
More informationAutomatic Reasoning (Section 8.3)
Automatic Reasoning (Section 8.3) Automatic Reasoning Can reasoning be automated? Yes, for some logics, including first-order logic. We could try to automate natural deduction, but there are many proof
More informationCMPSCI 250: Introduction to Computation. Lecture #1: Things, Sets and Strings David Mix Barrington 22 January 2014
CMPSCI 250: Introduction to Computation Lecture #1: Things, Sets and Strings David Mix Barrington 22 January 2014 Things, Sets, and Strings The Mathematical Method Administrative Stuff The Objects of Mathematics
More informationDatabase Systems CSE 414. Lecture 9-10: Datalog (Ch )
Database Systems CSE 414 Lecture 9-10: Datalog (Ch 5.3 5.4) CSE 414 - Spring 2017 1 Announcements HW2 is due today 11pm WQ2 is due tomorrow 11pm WQ3 is due Thursday 11pm HW4 is posted and due on Nov. 9,
More informationConnecting Statements. Today. First there was logic jumping forward.. ..and then proofs and then induction...
Today Review for Midterm. First there was logic... A statement is a true or false. Statements? 3 = 4 1? Statement! 3 = 5? Statement! 3? Not a statement! n = 3? Not a statement...but a predicate. Predicate:
More informationData types for mcrl2
Data types for mcrl2 Aad Mathijssen April 5, 2018 We provide a syntax for the standard data types of the mcrl2 language. This syntax is intended to be a practical mix between standard mathematical notation
More informationCSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 14: Set Theory: Definitions and Properties 1. Let C = {n Z n = 6r 5 for
More informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Explain the steps in a proof by (strong) mathematical induction Use (strong) mathematical induction
More informationAutomated Reasoning. Natural Deduction in First-Order Logic
Automated Reasoning Natural Deduction in First-Order Logic Jacques Fleuriot Automated Reasoning Lecture 4, page 1 Problem Consider the following problem: Every person has a heart. George Bush is a person.
More informationThe three faces of homotopy type theory. Type theory and category theory. Minicourse plan. Typing judgments. Michael Shulman.
The three faces of homotopy type theory Type theory and category theory Michael Shulman 1 A programming language. 2 A foundation for mathematics based on homotopy theory. 3 A calculus for (, 1)-category
More informationRelational Database: The Relational Data Model; Operations on Database Relations
Relational Database: The Relational Data Model; Operations on Database Relations Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Overview
More informationCS 4700: Artificial Intelligence
CS 4700: Foundations of Artificial Intelligence Fall 2017 Instructor: Prof. Haym Hirsh Lecture 16 Cornell Cinema Thursday, April 13 7:00pm Friday, April 14 7:00pm Sunday, April 16 4:30pm Cornell Cinema
More informationThis is already grossly inconvenient in present formalisms. Why do we want to make this convenient? GENERAL GOALS
1 THE FORMALIZATION OF MATHEMATICS by Harvey M. Friedman Ohio State University Department of Mathematics friedman@math.ohio-state.edu www.math.ohio-state.edu/~friedman/ May 21, 1997 Can mathematics be
More informationL05 - Negating Statements
L05 - Negating Statements CSci/Math 2112 15 May 2015 1 / 14 Assignment 1 Assignment 1 is now posted Due May 22 at the beginning of class Can work on it in groups, but separate write-up Don t forget your
More informationCOMS 1003 Fall Introduction to Computer Programming in C. Bits, Boolean Logic & Discrete Math. September 13 th
COMS 1003 Fall 2005 Introduction to Computer Programming in C Bits, Boolean Logic & Discrete Math September 13 th Hello World! Logistics See the website: http://www.cs.columbia.edu/~locasto/ Course Web
More informationCOMP Logic for Computer Scientists. Lecture 17
COMP 1002 Logic for Computer Scientists Lecture 17 5 2 J Puzzle: the barber In a certain village, there is a (male) barber who shaves all and only those men of the village who do not shave themselves.
More informationAnnouncements. Database Systems CSE 414. Datalog. What is Datalog? Why Do We Learn Datalog? HW2 is due today 11pm. WQ2 is due tomorrow 11pm
Announcements Database Systems CSE 414 Lecture 9-10: Datalog (Ch 5.3 5.4) HW2 is due today 11pm WQ2 is due tomorrow 11pm WQ3 is due Thursday 11pm HW4 is posted and due on Nov. 9, 11pm CSE 414 - Spring
More informationSection 2.4: Arguments with Quantified Statements
Section 2.4: Arguments with Quantified Statements In this section, we shall generalize the ideas we developed in Section 1.3 to arguments which involve quantified statements. Most of the concepts we shall
More informationMore Non-logical Features of Prolog
More Non-logical Features of Prolog Prof. Geraint A. Wiggins Centre for Cognition, Computation and Culture Goldsmiths College, University of London Contents Commit operators Implementing Negation as Failure
More informationr=1 The Binomial Theorem. 4 MA095/98G Revision
Revision Read through the whole course once Make summary sheets of important definitions and results, you can use the following pages as a start and fill in more yourself Do all assignments again Do the
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Dec 4, 2014 Outline 1 2 3 4 Definition A relation R from a set A to a set
More informationAppendix 1. Description Logic Terminology
Appendix 1 Description Logic Terminology Franz Baader Abstract The purpose of this appendix is to introduce (in a compact manner) the syntax and semantics of the most prominent DLs occurring in this handbook.
More informationAppendix 1. Description Logic Terminology
Appendix 1 Description Logic Terminology Franz Baader Abstract The purpose of this appendix is to introduce (in a compact manner) the syntax and semantics of the most prominent DLs occurring in this handbook.
More informationSet and Set Operations
Set and Set Operations Introduction A set is a collection of objects. The objects in a set are called elements of the set. A well defined set is a set in which we know for sure if an element belongs to
More informationSemantic Characterizations of XPath
Semantic Characterizations of XPath Maarten Marx Informatics Institute, University of Amsterdam, The Netherlands CWI, April, 2004 1 Overview Navigational XPath is a language to specify sets and paths in
More informationPart I Logic programming paradigm
Part I Logic programming paradigm 1 Logic programming and pure Prolog 1.1 Introduction 3 1.2 Syntax 4 1.3 The meaning of a program 7 1.4 Computing with equations 9 1.5 Prolog: the first steps 15 1.6 Two
More informationLecture 4: examples of topological spaces, coarser and finer topologies, bases and closed sets
Lecture 4: examples of topological spaces, coarser and finer topologies, bases and closed sets Saul Glasman 14 September 2016 Let s give the definition of an open subset of R. Definition 1. Let U R. We
More informationAbout the Author. Dependency Chart. Chapter 1: Logic and Sets 1. Chapter 2: Relations and Functions, Boolean Algebra, and Circuit Design
Preface About the Author Dependency Chart xiii xix xxi Chapter 1: Logic and Sets 1 1.1: Logical Operators: Statements and Truth Values, Negations, Conjunctions, and Disjunctions, Truth Tables, Conditional
More information