COMP Logic for Computer Scientists. Lecture 17
|
|
- Rosalyn Manning
- 6 years ago
- Views:
Transcription
1 COMP 1002 Logic for Computer Scientists Lecture J
2 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. Question: who shaves the barber?
3 Operations on sets Let and be two sets. Such as ={1,2,3} and ={ 2,3,4} Intersection = x x x } The green part of the picture above = {2,3} nion = x x x } The coloured part in the top picture. = 1,2,3,4 Difference = x x x } The yellow part in the top picture. = 1 - Symmetric difference Δ = ( ) The yellow and blue parts of the top picture. Δ = 1,4 Δ Complement = x x } The blue part on the bottom Venn diagram If universe = N, = x N x 1,2,3 }
4 Subsets and operations If then Intersection = nion = Difference = Difference =
5 Size (cardinality) If a set has n elements, for a natural number n, then is a finite set and its cardinality is =n. 1,2,3 = 3 = 0 Sets that are not finite are infinite. More on cardinality of infinite sets in a couple of lectures N, Z, Q R, C 0,1 : set of all finite-length binary strings.
6 Rule of inclusion-exclusion Let and be two sets. Then = + Proof idea: notice that elements in are counted twice in +, so need to subtract one copy. If and are disjoint, then = + If there are 112 students in COMP 1001, 70 in COMP 1002, and 12 of them are in both, then the total number of students in 1001 or 1002 is =170. For three sets (and generalizes) C = + + C C C + C C
7 Power sets power set of a set, P, is a set of all subsets of. Think of sets as boxes of elements. subset of a set is a box with elements of (maybe all, maybe none, maybe some). Then P is a box containing boxes with elements of. When you open the box P, you don t see chocolates (elements of ), you see boxes. Subsets of : ={1,2}, P =, 1, 2, 1,2 =, P =. They are not the same! There is nothing in, and there is one element, an empty box, in P If has n elements, then P has 2 n elements. Power set P
8 Cartesian products Cartesian product of and is a set of all pairs of elements with the first from, and the second from : x = x, y x, y } ={1,2,3}, ={a,b} = { 1, a, 1, b, 2, a, 2, b, 3, a, 3, b } ={1,2}, = { 1,1., 1,2, 2,1, 2,2 } Order of pairs does not matter, order within pairs does:. Number of elements in is = a b 1 (1,a) (1,b) 2 (2,a) (2,b) 3 (3,a) (3,b) x Can define the Cartesian product for any number of sets: 1 2 k = x 1, x 2, x k ) x 1 1 x k k = 1,2,3, ={a,b}, C={3,4} C = { 1, a, 3, 1, a, 4, 1, b, 3, 1, b, 4, 2, a, 3, 2, a, 4, 2, b, 3, 2, b, 4, 3, a, 3, 3, a, 4, 3, b, 3, 3, b, 4 }
9 Proofs with sets Two ways to describe the purple area, x when x This happens when x x. So x. Since we picked an arbitrary x, then Not quite done yet Now let x Then x x. So x x. x x x x. So x. Thus x. Since x was an arbitrary element of, then. Therefore =
10 Laws of set theory Two ways to describe the purple area = y similar reasoning, = Does this remind you of something?... p q p q DeMorgan s law works in set theory! What about other equivalences from logic?
11 More useful equivalences For any formulas,, C: TTTT FFFFF TTTT TTTT. TTTT FFFFF. FFFFF FFFFF lso, like in arithmetic (with as +, as *) aaa C C Same holds for. lso, C C C nd unlike arithmetic C C ( C)
12 Propositions vs. sets Propositional logic Set theory Negation p Complement p q Intersection OR p q nion FLSE TRE Empty set niverse
13 More useful equivalences For any formulas,, C: TTTT FFFFF TTTT TTTT. TTTT FFFFF. FFFFF FFFFF lso, like in arithmetic (with as +, as *) aaa C C Same holds for. lso, C C C nd unlike arithmetic C C ( C)
14 Laws of set theory For any sets,, C: = = =. = =. = = = lso, like in arithmetic (with as +, as *) = aaa C = C Same holds for. lso, C = C C nd unlike arithmetic - C C ( C)
15 oolean algebra The algebra of both propositional logic and set theory is called oolean algebra (as opposed to algebra on numbers). Propositional logic Set theory oolean algebra Negation p Complement a p q Intersection a b OR p q nion a + b FLSE Empty set 0 TRE niverse 1
16 xioms of oolean algebra 1. a + b = b + a, a b = b a 2. (a+b)+c=a+(b+c) a b c = a b c 3. a + b c = a + b a + c a b + c = a b + (a c ) 4. There exist distinct elements 0 and 1 (among underlying set of elements of the algebra) such that for all a, a + 0 = a a 1 = a 5. For each a there exists an element a such that a + a = 1 a a = 0 How about DeMorgan, etc? They can be derived from the axioms!
17 Puzzle: the barber club In a certain barber s club, Every member has shaved at least one other member No member shaved himself No member has been shaved by more than one member There is a member who has never been shaved. Question: how many barbers are in this club?
Chapter 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 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 informationCSC 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 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 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 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 information2. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2014 1 2. Sets 2.1&2.2: Sets and Subsets. Combining Sets. Set Terminology and Notation DEFINITIONS: Set is well-defined collection of objects. Elements are objects or members
More informationSets 1. The things in a set are called the elements of it. If x is an element of the set S, we say
Sets 1 Where does mathematics start? What are the ideas which come first, in a logical sense, and form the foundation for everything else? Can we get a very small number of basic ideas? Can we reduce it
More informationThis Lecture. We will first introduce some basic set theory before we do counting. Basic Definitions. Operations on Sets.
Sets A B C This Lecture We will first introduce some basic set theory before we do counting. Basic Definitions Operations on Sets Set Identities Defining Sets Definition: A set is an unordered collection
More informationOutline. CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 1 Sets. Sets. Enumerating the elements of a set
Outline CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 1 Sets rthur G. Werschulz Fordham University Department of Computer and Information Sciences Copyright rthur G. Werschulz, 2017.
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 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 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 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 informationSETS. Sets are of two sorts: finite infinite A system of sets is a set, whose elements are again sets.
SETS A set is a file of objects which have at least one property in common. The objects of the set are called elements. Sets are notated with capital letters K, Z, N, etc., the elements are a, b, c, d,
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 information2 Review of Set Theory
2 Review of Set Theory Example 2.1. Let Ω = {1, 2, 3, 4, 5, 6} 2.2. Venn diagram is very useful in set theory. It is often used to portray relationships between sets. Many identities can be read out simply
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 informationReview of Sets. Review. Philippe B. Laval. Current Semester. Kennesaw State University. Philippe B. Laval (KSU) Sets Current Semester 1 / 16
Review of Sets Review Philippe B. Laval Kennesaw State University Current Semester Philippe B. Laval (KSU) Sets Current Semester 1 / 16 Outline 1 Introduction 2 Definitions, Notations and Examples 3 Special
More informationProblem One: A Quick Algebra Review
CS103A Winter 2019 Solutions for Week One Handout 01S Problem One: A Quick Algebra Review In the first week of CS103, we'll be doing a few proofs that will require some algebraic manipulations and reasoning
More information1 Sets, Fields, and Events
CHAPTER 1 Sets, Fields, and Events B 1.1 SET DEFINITIONS The concept of sets play an important role in probability. We will define a set in the following paragraph. Definition of Set A set is a collection
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 information11 Sets II Operations
11 Sets II Operations Tom Lewis Fall Term 2010 Tom Lewis () 11 Sets II Operations Fall Term 2010 1 / 12 Outline 1 Union and intersection 2 Set operations 3 The size of a union 4 Difference and symmetric
More informationFuzzy Reasoning. Outline
Fuzzy Reasoning Outline Introduction Bivalent & Multivalent Logics Fundamental fuzzy concepts Fuzzification Defuzzification Fuzzy Expert System Neuro-fuzzy System Introduction Fuzzy concept first introduced
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 informationSection Sets and Set Operations
Section 6.1 - Sets and Set Operations Definition: A set is a well-defined collection of objects usually denoted by uppercase letters. Definition: The elements, or members, of a set are denoted by lowercase
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 informationSlides for Faculty Oxford University Press All rights reserved.
Oxford University Press 2013 Slides for Faculty Assistance Preliminaries Author: Vivek Kulkarni vivek_kulkarni@yahoo.com Outline Following topics are covered in the slides: Basic concepts, namely, symbols,
More informationUNIT 14C The Limits of Computing: Non computable Functions. Problem Classifications
UNIT 14C The Limits of Computing: Non computable Functions 1 Problem Classifications Tractable Problems Problems that have reasonable, polynomialtime solutions Intractable Problems Problems that may have
More informationLECTURE NOTES ON SETS
LECTURE NOTES ON SETS PETE L. CLARK Contents 1. Introducing Sets 1 2. Subsets 5 3. Power Sets 5 4. Operations on Sets 6 5. Families of Sets 8 6. Partitions 10 7. Cartesian Products 11 1. Introducing Sets
More informationSolution: It may be helpful to list out exactly what is in each of these events:
MATH 5010(002) Fall 2017 Homework 1 Solutions Please inform your instructor if you find any errors in the solutions. 1. You ask a friend to choose an integer N between 0 and 9. Let A = {N 5}, B = {3 N
More informationThe Intersection of Two Sets
Venn Diagrams There are times when it proves useful or desirable for us to represent sets and the relationships among them in a visual manner. This can be beneficial for a variety of reasons, among which
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 informationSets. {1, 2, 3, Calvin}.
ets 2-24-2007 Roughly speaking, a set is a collection of objects. he objects are called the members or the elements of the set. et theory is the basis for mathematics, and there are a number of axiom systems
More informationFigure 1: From Left to Right, General Venn Diagrams for One, Two, and Three Sets
2.3. VENN DIAGRAMS & SET OPERATIONS In this section we introduce Venn diagrams and define four basic operations on sets. We also present some important properties related to these operations. Venn Diagrams
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 informationSets and set operations
CS 44 Discrete Mathematics for CS Lecture Sets and set operations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Course administration Homework 3: Due today Homework 4: Due next week on Friday,
More informationCounting. Rosen, Chapter 6 Walls and Mirrors, Chapter 3
Counting Rosen, Chapter 6 Walls and Mirrors, Chapter 3 Spock's dilemma (Walls and mirrors) n planets in the solar system can only visit k
More informationBoolean relationships on Venn Diagrams
Boolean relationships on Venn Diagrams The fourth example has A partially overlapping B. Though, we will first look at the whole of all hatched area below, then later only the overlapping region. Let's
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 informationMAT 090 Brian Killough s Instructor Notes Strayer University
MAT 090 Brian Killough s Instructor Notes Strayer University Success in online courses requires self-motivation and discipline. It is anticipated that students will read the textbook and complete sample
More informationNotes on Topology. Andrew Forrester January 28, Notation 1. 2 The Big Picture 1
Notes on Topology Andrew Forrester January 28, 2009 Contents 1 Notation 1 2 The Big Picture 1 3 Fundamental Concepts 2 4 Topological Spaces and Topologies 2 4.1 Topological Spaces.........................................
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 informationThompson groups, Cantor space, and foldings of de Bruijn graphs. Peter J. Cameron University of St Andrews
Thompson groups, Cantor space, and foldings of de Bruijn graphs Peter J Cameron University of St Andrews Breaking the boundaries University of Sussex April 25 The 97s Three groups I was born (in Paul Erdős
More information1.2 Venn Diagrams and Partitions
1.2 Venn Diagrams and Partitions Mark R. Woodard Furman U 2010 Mark R. Woodard (Furman U) 1.2 Venn Diagrams and Partitions 2010 1 / 9 Outline 1 Venn Diagrams 2 Partitions 3 Fundamentals of Counting Mark
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 informationProvide a drawing. Mark any line with three points in blue color.
Math 3181 Name: Dr. Franz Rothe August 18, 2014 All3181\3181_fall14h1.tex Homework has to be turned in this handout. For extra space, use the back pages, or blank pages between. The homework can be done
More information2.1 Symbols and Terminology
2.1 Symbols and Terminology A is a collection of objects or things. The objects belonging to the are called the, or. - : there is a way of determining for sure whether a particular item is an element of
More informationTaibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from Discrete Mathematics and It's Applications Kenneth H.
More informationSEVENTH EDITION and EXPANDED SEVENTH EDITION
SEVENTH EDITION and EXPANDED SEVENTH EDITION Slide 2-1 Chapter 2 Sets 2.1 Set Concepts Set A collection of objects, which are called elements or members of the set. Listing the elements of a set inside
More informationSets. X. Zhang Dept. of Computer & Information Sciences Fordham University
Sets! X. Zhang Dept. of Computer & Information Sciences Fordham University 1 Outline on sets! Basics!! Specify a set by enumerating all elements!! Notations!! Cardinality!! Venn Diagram!! Relations on
More informationChapter 2: Sets. Diana Pell. In the roster method: elements are listed between braces, with commas between the elements
Chapter 2: Sets Diana Pell 2.1: The Nature of Sets Set: any collection of elements. Elements: objects of the set. In the roster method: elements are listed between braces, with commas between the elements
More information1KOd17RMoURxjn2 CSE 20 DISCRETE MATH Fall
CSE 20 https://goo.gl/forms/1o 1KOd17RMoURxjn2 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Explain the steps in a proof by mathematical and/or structural
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 informationAbout the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Discrete Mathematics
About the Tutorial Discrete Mathematics is a branch of mathematics involving discrete elements that uses algebra and arithmetic. It is increasingly being applied in the practical fields of mathematics
More informationCounting: Basics. Rosen, Chapter 6.1
Counting: Basics Rosen, Chapter 6.1 A simple counting problem n You have 6 pairs of pants and 10 shirts. How many different outfits does this give? n Possible answers: A) 6 x 10 B) 6 + 10 Counting: the
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 informationFundamental Mathematical Concepts Math 107A. Professor T. D. Hamilton
Fundamental Mathematical Concepts Math 107A Professor T. D. Hamilton January 17, 2007 2 Contents 1 Set Theory 7 What is a set?.......................................... 7 Describing a Set.........................................
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 informationLogic Synthesis & Optimization Lectures 4, 5 Boolean Algebra - Basics
Logic Synthesis & Optimization Lectures 4, 5 Boolean Algebra - Basics 1 Instructor: Priyank Kalla Department of Electrical and Computer Engineering University of Utah, Salt Lake City, UT 84112 Email: kalla@ece.utah.edu
More informationAlgebra of Sets. Aditya Ghosh. April 6, 2018 It is recommended that while reading it, sit with a pen and a paper.
Algebra of Sets Aditya Ghosh April 6, 2018 It is recommended that while reading it, sit with a pen and a paper. 1 The Basics This article is only about the algebra of sets, and does not deal with the foundations
More informationMATH 22 MORE ABOUT FUNCTIONS. Lecture M: 10/14/2003. Form follows function. Louis Henri Sullivan
MATH 22 Lecture M: 10/14/2003 MORE ABOUT FUNCTIONS Form follows function. Louis Henri Sullivan This frightful word, function, was born under other skies than those I have loved. Le Corbusier D ora innanzi
More informationc) the set of students at your school who either are sophomores or are taking discrete mathematics
Exercises Exercises Page 136 1. Let A be the set of students who live within one mile of school and let B be the set of students who walk to classes. Describe the students in each of these sets. a) A B
More informationLecture 6,
Lecture 6, 4.16.2009 Today: Review: Basic Set Operation: Recall the basic set operator,!. From this operator come other set quantifiers and operations:!,!,!,! \ Set difference (sometimes denoted, a minus
More informationLecture 5: More Examples/Applications of Quasirandom Graphs
Random and Quasirandom Graphs Instructor: Padraic Bartlett Lecture 5: More Examples/Applications of Quasirandom Graphs Week 4 Mathcamp 2012 In our last class, we saw that the Paley graphs were an example
More informationCHAPTER 1 BOOLEAN ALGEBRA CONTENTS
pplied R&M Manual for Defence Systems Part D - Supporting Theory HPTER 1 OOLEN LGER ONTENTS Page 1 INTRODUTION 2 2 NOTTION 2 3 XIOMS ND THEOREMS 3 4 SET THEORY 5 5 PPLITION 6 Issue 1 Page 1 hapter 1 oolean
More informationAlgebra of Sets (Mathematics & Logic A)
Algebra of Sets (Mathematics & Logic A) RWK/MRQ October 28, 2002 Note. These notes are adapted (with thanks) from notes given last year by my colleague Dr Martyn Quick. Please feel free to ask me (not
More informationRelational terminology. Databases - Sets & Relations. Sets. Membership
Relational terminology Databases - & Much of the power of relational databases comes from the fact that they can be described analysed mathematically. In particular, queries can be expressed with absolute
More informationEric Roberts Handout #39 CS 106B February 20, 2015 Sets
Eric Roberts Handout #39 S 106 February 20, 2015 Sets Sets Eric Roberts S 106 February 20, 2015 Outline 1. Midcourse correction 2. Sets in mathematics 3. Venn diagrams 4. High-level set operations 5. Implementing
More informationComplexity Theory. Compiled By : Hari Prasad Pokhrel Page 1 of 20. ioenotes.edu.np
Chapter 1: Introduction Introduction Purpose of the Theory of Computation: Develop formal mathematical models of computation that reflect real-world computers. Nowadays, the Theory of Computation can be
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 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 informationThe Inclusion-Exclusion Principle
The Inclusion-Exclusion Principle Table of Contents 1 Order of a Set 1 2 The Inclusion-Exclusion Principle 1 3 Examples 2 4 Homework Problems 5 4.1 Instructions...................................... 5
More information9.5 Equivalence Relations
9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same
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 informationA point is pictured by a dot. While a dot must have some size, the point it represents has no size. Points are named by capital letters..
Chapter 1 Points, Lines & Planes s we begin any new topic, we have to familiarize ourselves with the language and notation to be successful. My guess that you might already be pretty familiar with many
More informationMath 110 FOUNDATIONS OF THE REAL NUMBER SYSTEM FOR ELEMENTARY AND MIDDLE SCHOOL TEACHERS
2-1Numeration Systems Hindu-Arabic Numeration System Tally Numeration System Egyptian Numeration System Babylonian Numeration System Mayan Numeration System Roman Numeration System Other Number Base Systems
More informationMath 202 Test Problem Solving, Sets, and Whole Numbers 19 September, 2008
Math 202 Test Problem Solving, Sets, and Whole Numbers 19 September, 2008 Ten questions, each worth the same amount. Complete six of your choice. I will only grade the first six I see. Make sure your name
More information11,23,35,47 B) 1 is a multiple of 12
Where applicable, indicates that none of the above answers is correct. 1. Let X x x 1 is a multiple of 3 and 5 and 1 is a multiple of 4 Find XY. Y y y y. 11,23,35,47 B) 1 is a multiple of 12 A) z z C)
More informationAutomated Reasoning Systems
Automated Reasoning Systems Resolution Theorem Proving: Prover9 Temur Kutsia RISC, Johannes Kepler University of Linz, Austria kutsia@risc.uni-linz.ac.at May 11, 2011 Prover9 Automated theorem prover from
More informationHOMEWORK #4 SOLUTIONS - MATH 4160
HOMEWORK #4 SOLUTIONS - MATH 4160 DUE: FRIDAY MARCH 7, 2002 AT 10:30AM Enumeration problems. (1 How many different ways are there of labeling the vertices of the following trees so that the graphs are
More informationAXIOMS FOR THE INTEGERS
AXIOMS FOR THE INTEGERS BRIAN OSSERMAN We describe the set of axioms for the integers which we will use in the class. The axioms are almost the same as what is presented in Appendix A of the textbook,
More informationSET DEFINITION 1 elements members
SETS SET DEFINITION 1 Unordered collection of objects, called elements or members of the set. Said to contain its elements. We write a A to denote that a is an element of the set A. The notation a A denotes
More informationLecture 20 : Trees DRAFT
CS/Math 240: Introduction to Discrete Mathematics 4/12/2011 Lecture 20 : Trees Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we discussed graphs. Today we continue this discussion,
More informationCS228 - Basic Counting and the Pigeonhole Principle
CS228 - Basic Counting and the Pigeonhole Principle Nathan Sprague February 19, 2014 Material in these slides is from Discrete Mathematics and Its Applications 7e, Kenneth Rosen, 2012. The Product Rule
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 informationMath Introduction to Advanced Mathematics
Math 215 - Introduction to Advanced Mathematics Number Theory Fall 2017 The following introductory guide to number theory is borrowed from Drew Shulman and is used in a couple of other Math 215 classes.
More informationCOMP 122/L Lecture 2. Kyle Dewey
COMP 122/L Lecture 2 Kyle Dewey Outline Operations on binary values AND, OR, XOR, NOT Bit shifting (left, two forms of right) Addition Subtraction Twos complement Bitwise Operations Bitwise AND Similar
More informationAn Interesting Way to Combine Numbers
An Interesting Way to Combine Numbers Joshua Zucker and Tom Davis October 12, 2016 Abstract This exercise can be used for middle school students and older. The original problem seems almost impossibly
More informationTopology notes. Basic Definitions and Properties.
Topology notes. Basic Definitions and Properties. Intuitively, a topological space consists of a set of points and a collection of special sets called open sets that provide information on how these points
More informationIntroduction to Homotopy Type Theory
Introduction to Homotopy Type Theory Lecture notes for a course at EWSCS 2017 Thorsten Altenkirch March 5, 2017 1 What is this course about? To explain what Homotopy Type Theory is, I will first talk about
More informationThe Further Mathematics Support Programme
Degree Topics in Mathematics Groups A group is a mathematical structure that satisfies certain rules, which are known as axioms. Before we look at the axioms, we will consider some terminology. Elements
More informationTOPICS. Integers Properties of addition and. Rational Numbers Need for rational numbers. Exponents or Powers Introduction to Exponents or
TOPICS DETAILS Integers Properties of addition and subtraction of integers Multiplication of integers Properties of multiplication of integers Division of integers Properties of division of integers Introduction
More informationCHAPTER 8. Copyright Cengage Learning. All rights reserved.
CHAPTER 8 RELATIONS Copyright Cengage Learning. All rights reserved. SECTION 8.3 Equivalence Relations Copyright Cengage Learning. All rights reserved. The Relation Induced by a Partition 3 The Relation
More informationBawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University
Logic Design First Stage Lecture No.5 Boolean Algebra Bawar Abid Abdalla Assistant Lecturer Software Engineering Department Koya University Boolean Operations Laws of Boolean Algebra Rules of Boolean Algebra
More informationCNS 188a Overview. Implementing Boolean functions with relay circuits, circuits of AON (AND, OR, NOT) gates and LT (Linear Threshold) gates
CNS 88a Overview Boolean algebra as an axiomatic system Boolean functions and their representations using Boolean formulas and spectral methods Implementing Boolean functions with relay circuits, circuits
More informationDiscrete Mathematics
Discrete Mathematics Lecture 2: Basic Structures: Set Theory MING GAO DaSE@ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 18, 2017 Outline 1 Set Concepts 2 Set Operations 3 Application
More informationCSE 417 Network Flows (pt 4) Min Cost Flows
CSE 417 Network Flows (pt 4) Min Cost Flows Reminders > HW6 is due Monday Review of last three lectures > Defined the maximum flow problem find the feasible flow of maximum value flow is feasible if it
More informationHW Graph Theory SOLUTIONS (hbovik) - Q
1, Diestel 9.3: An arithmetic progression is an increasing sequence of numbers of the form a, a+d, a+ d, a + 3d.... Van der Waerden s theorem says that no matter how we partition the natural numbers into
More informationSeparation Logic: syntax, semantics and calculus
Separation Logic: syntax, semantics and calculus Syntax Semantics Calculus emp SL N/A FOL N/A = + Arithmetic N/A := ; while if then else [.] dispose(.) cons(.) State is a pair (Store,Heap) St(.) maps variables
More information