Announcements. CompSci 230 Discrete Math for Computer Science Sets. Introduction to Sets. Sets


 Robyn Harrington
 1 years ago
 Views:
Transcription
1 CompSci 230 Discrete Math for Computer Science Sets September 12, 2013 Prof. Rodger Slides modified from Rosen 1 nnouncements Read for next time Chap Homework 2 due Tuesday Recitation 3 on Friday and Monday Microsoft Hackathon Fri 5pm for 24 hours Microsoft will be holding a 24 hour hackathon called CampppHack starting at *5pm on 9/13*. The hackathon will be focused on Windows 8 andwindows Phone, and will begin with crash courses to teach you how to develop apps for each of these platforms. fter 24 hours of apphacking a panel of expert judges will choose the three top apps and award a number of awesome prizes, including an *allexpenses paid trip to Microsoft headquarters* in Redmond, W, Microsoft Surfaces and Phones, and cash. In addition, they ll be giving away SWG to lucky attendees every hour, and dinner, breakfast and lunch will be provided! 2 Introduction to Sets Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Important for counting. Programming languages have set operations. Set theory is an important branch of mathematics. Many different systems of axioms have been used to develop set theory. Here we are not concerned with a formal set of axioms for set theory. Instead, we will use what is called naïve set theory. 3 Sets set is an unordered collection of objects. the students in this class the attendees at a Duke Football Game The objects in a set are called the elements, or members of the set. set is said to contain its elements. The notation denotes that is an element of the set. If is not a member of, write 4
2 Sets Programming Class (PC) vs. Discrete Math Class (DM) D.M. formal notation, proofs P. C.  implementation Describing a Set: Roster Method Order not important Each distinct object is either a member or not; listing more than once does not change the set. 5 6 Roster Method Set of all vowels in the English alphabet: Set of all odd positive integers less than : Set of all positive integers less than : Some Important Sets = natural numbers = = integers = = positive integers = = set of real numbers = set of positive real numbers = set of complex numbers. Q = set of rational numbers 7 8
3 SetBuilder Notation Specify the property or properties that all members must satisfy: x x x x x x x predicate may be used: x x Example: x x Positive rational numbers: x R x Interval Notation closed interval [a,b] open interval (a,b) 9 10 niversal Set and Empty Set The universal set is the set containing everything currently under consideration. Sometimes implicit Sometimes explicitly stated. Contents depend on the context. The empty set is the set with no elements. Symbolized {} also used. V Venn Diagram a e i o u John Venn ( ) Cambridge, K 11 Russell s Paradox Let S be the set of all sets which are not members of themselves. paradox results from trying to answer the question Is S a member of itself? Related Paradox: Henry is a barber who shaves all people who do not shave themselves. paradox results from trying to answer the question Does Henry shave himself? Bertrand Russell ( ) Cambridge, K Nobel Prize Winner 12
4 Some things to remember Sets can be elements of sets. How many elements? re these the same? Set Equality Definition: Two sets are equal if and only if they have the same elements. Therefore if and B are sets, then and B are equal if and only if. We write = B if and B are equal sets. re these sets equal? Equal! Equal! Not equal! Subsets Definition: The set is a subset of B, if and only if every element of is also an element of B. The notation true. Is for any set S? Because a is always false, S,for every set S Is for any set S? Because a S a S, S S, for every set S. is Showing a Set is or is not a Subset of nother Set Showing that is a Subset of B: To show that B, show that if x belongs to, then x also belongs to B. Showing that is not a Subset of B: To show that is not a subset of B, B, find an element x with x B. (Such an x is a counterexample to the claim that x implies x B.) Examples: 1. Is the set of all computer science majors at Duke a subset of all students at Duke? 2. Is the set of integers with squares less than 100 a subset of the set of nonnegative integers? 3. Is the set of Duke fans a subset of all students at Duke? 15 16
5 nother look at Equality of Sets Recall that two sets and B are equal, denoted by = B, iff sing logical equivalences we have that = B iff Proper Subsets Definition: If B, but B, then we say is a proper subset of B, denoted by B B, then This is equivalent to B and B 17 Venn Diagram B 18 Set Cardinality Definition: If there are exactly n distinct elements in S where n is a nonnegative integer, we say that S is finite. Otherwise it is infinite. Definition: The cardinality of a finite set, denoted by, is the number of (distinct) elements of. Examples: 1. ø = 2. Let S be the letters of the English alphabet. Then S = 3. { } = 4. {ø} = 5. The set of integers is infinite. 19 Power Sets Definition: The set of all subsets of a set, denoted P(), is called the power set of. Example: If = {a,b} then P() = {ø, {a},{b},{a,b}} What is the size of P({4, 6, 9, 12, 15})? If a set has n elements, then the cardinality of the power set is ⁿ. (In Chapters 5 and 6, we will discuss different ways to show this.) 20
6 Tuples The ordered ntuple 1 2 n is the ordered collection that has 1 as its first element and 2 as its second element and so on until n as its last element. Two ntuples are equal if and only if their corresponding elements are equal. 2tuples are called ordered pairs. The ordered pairs ( ) and ( ) are equal if and only if and. 21 Cartesian Product Definition: The Cartesian Product of two sets and B, denoted by B is the set of ordered pairs (a,b) where a and b B. Example: = {a,b} B = {1,2,3} B = {(a,1),(a,2),(a,3), (b,1),(b,2),(b,3)} Definition: subset R of the Cartesian product B is called a relation from the set to the set B. (Relations will be covered in depth in Chapter 9. ) René Descartes Cartesian Product Definition: The cartesian products of the sets 1 2 n, denoted by 1 2 n is the set of ordered ntuples ( 1 2 n ) where i belongs to i for i =,. Truth Sets of Quantifiers Given a predicate P and a domain D, we define the truth set of P to be the set of elements in D for which P(x) is true. The truth set of P(x) is denoted by Example: What is B C where = {0,1}, B = {1,2} and C = {0,1,2} Size is? Solution: B C= {(0,1,0), (0,1,1), (0,1,2),(0,2,0), (0,2,1), (0,2,2),(1,1,0), (1,1,1), (1,1,2), (1,2,0), (1,2,1), (1,1,2)} 23 Example: The truth set of P(x) where the domain is the integers and P(x) is x = is the set 24
7 Boolean lgebra Propositional calculus and set theory are both instances of an algebraic system called a Boolean lgebra. The operators in set theory are analogous to the corresponding operator in propositional calculus. s always there must be a universal set. ll sets are assumed to be subsets of. Boolean algebra is fundamental to the development of Computer Science and digital logic! nion Definition: Let and B be sets. The union of the sets and B, denoted by B, is the set: Example: What is {? Solution: { Venn Diagram for B B Intersection Definition: The intersection of sets and B, denoted by B, is Note if the intersection is empty, then and B are said to be disjoint. Example: What is? Example:What is? Venn Diagram for B Complement Definition: If is a set, then the complement of (with respect to ), denoted by Ā is the set Ā x x (The complement of is sometimes denoted by c.) Example: If is the positive integers less than 100, what is the complement of x x x x B 27 Venn Diagram for Complement Ā 28
8 Difference Definition: Let and B be sets. The difference of and B, denoted by B, is the set containing the elements of that are not in B. The difference of and B is also called the complement of B with respect to. B x x x B B The Cardinality of the nion of Two Sets B Venn Diagram for B Review Questions Example: = {0,1,2,3,4,5,6,7,8,9,10} = {1,2,3,4,5}, B ={4,5,6,7,8} 1. B Solution: {1,2,3,4,5,6,7,8} 2. B Solution: {4,5} 3. Ā Solution: {0,6,7,8,9,10} 4. Solution: {0,1,2,3,9,10} 5. B Solution: {1,2,3} 6. B Solution: {6,7,8} 31 Symmetric Difference Definition: The symmetric difference of and B, denoted by is the set Example: What is: Solution B B Venn Diagram 32
9 Set Identities Set Identities Identity laws Commutative laws Domination laws ssociative laws Idempotent laws Complementation law Distributive laws Continued on next slide 33 Continued on next slide 34 De Morgan s laws bsorption laws Complement laws Set Identities 35 Proving Set Identities Different ways to prove set identities: 1. Prove that each set (side of the identity) is a subset of the other. 2. se set builder notation and propositional logic. 3. Membership Tables: Verify that elements in the same combination of sets always either belong or do not belong to the same side of the identity. se to indicate it is in the set and a to indicate that it is not. 36
10 Proof of Second De Morgan Law Example: Prove that Solution: We prove this identity by showing that: Proof of Second De Morgan Law These steps show that: 1) and 2) Continued on next slide 37 Continued on next slide 38 Proof of Second De Morgan Law These steps show that: SetBuilder Notation: Second De Morgan Law 39 40
11 Exampl e: Solutio n: Membership Table Construct a membership table to show that the distributive law holds. B C Generalized nions and Intersections Let 1, 2,, n be an indexed collection of sets. We define: These are well defined, since union and intersection are associative. For i =,,, let i = {i, i +, i +,.}. Then, 42 Problems Can you conclude that =B, if, B, and C are sets such that? Cannot conclude they could be different subsets? Cannot conclude C could be empty set 43 Problems Can you conclude that =B, if, B and C are sets such that and? Yes! By symmetry, Show Suppose, then 2 cases If, then thus If, then thus Thus, by symmetry, thus 44
12 Problems Can you conclude that =B, if, B and C are sets such that and? Yes! By symmetry, Show Suppose, then 2 cases If, then thus If, then thus Thus, by symmetry, thus 45
INTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H1088 Budapest, Múzeum krt. 68. CONTENTS 1. SETS Set, equal sets, subset,
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationMathematics Review for MS Finance Students
Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
More informationMath 166  Week in Review #4. A proposition, or statement, is a declarative sentence that can be classified as either true or false, but not both.
Math 166 Spring 2007 c Heather Ramsey Page 1 Math 166  Week in Review #4 Sections A.1 and A.2  Propositions, Connectives, and Truth Tables A proposition, or statement, is a declarative sentence that
More informationAll of mathematics can be described with sets. This becomes more and
CHAPTER 1 Sets All of mathematics can be described with sets. This becomes more and more apparent the deeper into mathematics you go. It will be apparent in most of your upper level courses, and certainly
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
More informationSet Theory. 2.1 Presenting Sets CHAPTER2
CHAPTER2 Set Theory 2.1 Presenting Sets Certain notions which we all take for granted are harder to define precisely than one might expect. In Taming the Infinite: The Story of Mathematics, Ian Stewart
More informationAutomata Theory. Şubat 2006 Tuğrul Yılmaz Ankara Üniversitesi
Automata Theory Automata theory is the study of abstract computing devices. A. M. Turing studied an abstract machine that had all the capabilities of today s computers. Turing s goal was to describe the
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informationThe Set Data Model CHAPTER 7. 7.1 What This Chapter Is About
CHAPTER 7 The Set Data Model The set is the most fundamental data model of mathematics. Every concept in mathematics, from trees to real numbers, is expressible as a special kind of set. In this book,
More information1 The Concept of a Mapping
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 1 The Concept of a Mapping The concept of a mapping (aka function) is important throughout mathematics. We have been dealing
More informationBook of Proof. Richard Hammack Virginia Commonwealth University
Book of Proof Richard Hammack Virginia Commonwealth University Richard Hammack (publisher) Department of Mathematics & Applied Mathematics P.O. Box 842014 Virginia Commonwealth University Richmond, Virginia,
More informationSummary. Operations on Fuzzy Sets. Zadeh s Definitions. Zadeh s Operations TNorms SNorms. Properties of Fuzzy Sets Fuzzy Measures
Summary Operations on Fuzzy Sets Zadeh s Operations TNorms SNorms Adriano Cruz 00 NCE e IM/UFRJ adriano@nce.ufrj.br Properties of Fuzzy Sets Fuzzy Measures One should not increase, beyond what is necessary,
More information3. SETS, FUNCTIONS & RELATIONS
3. SETS, FUNCTIONS & RELATIONS If I see the moon, then the moon sees me 'Cos seeing's symmetric as you can see. If I tell Aunt Maude and Maude tells the nation Then I've told the nation 'cos the gossiping
More informationThis chapter is all about cardinality of sets. At first this looks like a
CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },
More informationSOLUTIONS TO ASSIGNMENT 1 MATH 576
SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts
More informationPropositional Logic. A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both.
irst Order Logic Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both. Are the following sentences propositions? oronto
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 19967 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
More information4. CLASSES OF RINGS 4.1. Classes of Rings class operator Aclosed Example 1: product Example 2:
4. CLASSES OF RINGS 4.1. Classes of Rings Normally we associate, with any property, a set of objects that satisfy that property. But problems can arise when we allow sets to be elements of larger sets
More informationYou know from calculus that functions play a fundamental role in mathematics.
CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.
More informationDiscrete Mathematics II: Set Theory for Computer Science Part IA Comp. Sci. Lecture Notes
Discrete Mathematics II: Set Theory for Computer Science Part IA Comp. Sci. Lecture Notes Glynn Winskel c Glynn Winskel February 10, 2012 2 Syllabus for Discrete Mathematics II Lecturer: Professor Glynn
More informationDedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes)
Dedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes) by Jim Propp (UMass Lowell) March 14, 2010 1 / 29 Completeness Three common
More informationAlgebra 2 Notes AII.7 Functions: Review, Domain/Range. Function: Domain: Range:
Name: Date: Block: Functions: Review What is a.? Relation: Function: Domain: Range: Draw a graph of a : a) relation that is a function b) relation that is NOT a function Function Notation f(x): Names the
More informationPredicate Logic. Example: All men are mortal. Socrates is a man. Socrates is mortal.
Predicate Logic Example: All men are mortal. Socrates is a man. Socrates is mortal. Note: We need logic laws that work for statements involving quantities like some and all. In English, the predicate is
More informationUnderstanding Basic Calculus
Understanding Basic Calculus S.K. Chung Dedicated to all the people who have helped me in my life. i Preface This book is a revised and expanded version of the lecture notes for Basic Calculus and other
More informationTo define function and introduce operations on the set of functions. To investigate which of the field properties hold in the set of functions
Chapter 7 Functions This unit defines and investigates functions as algebraic objects. First, we define functions and discuss various means of representing them. Then we introduce operations on functions
More informationCopy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.
Algebra 2  Chapter Prerequisites Vocabulary Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any. P1 p. 1 1. counting(natural) numbers  {1,2,3,4,...}
More informationA Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions
A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved First Draft February 8, 2006 1 Contents 25
More informationparent ROADMAP MATHEMATICS SUPPORTING YOUR CHILD IN HIGH SCHOOL
parent ROADMAP MATHEMATICS SUPPORTING YOUR CHILD IN HIGH SCHOOL HS America s schools are working to provide higher quality instruction than ever before. The way we taught students in the past simply does
More informationMathematics for Econometrics, Fourth Edition
Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationSolutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014
Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014 3.4: 1. If m is any integer, then m(m + 1) = m 2 + m is the product of m and its successor. That it to say, m 2 + m is the
More informationADDITIVE GROUPS OF RINGS WITH IDENTITY
ADDITIVE GROUPS OF RINGS WITH IDENTITY SIMION BREAZ AND GRIGORE CĂLUGĂREANU Abstract. A ring with identity exists on a torsion Abelian group exactly when the group is bounded. The additive groups of torsionfree
More information(LMCS, p. 317) V.1. First Order Logic. This is the most powerful, most expressive logic that we will examine.
(LMCS, p. 317) V.1 First Order Logic This is the most powerful, most expressive logic that we will examine. Our version of firstorder logic will use the following symbols: variables connectives (,,,,
More informationLAKE ELSINORE UNIFIED SCHOOL DISTRICT
LAKE ELSINORE UNIFIED SCHOOL DISTRICT Title: PLATO Algebra 1Semester 2 Grade Level: 1012 Department: Mathematics Credit: 5 Prerequisite: Letter grade of F and/or N/C in Algebra 1, Semester 2 Course Description:
More informationSMALL SKEW FIELDS CÉDRIC MILLIET
SMALL SKEW FIELDS CÉDRIC MILLIET Abstract A division ring of positive characteristic with countably many pure types is a field Wedderburn showed in 1905 that finite fields are commutative As for infinite
More informationComplement. If A is an event, then the complement of A, written A c, means all the possible outcomes that are not in A.
Complement If A is an event, then the complement of A, written A c, means all the possible outcomes that are not in A. For example, if A is the event UNC wins at least 5 football games, then A c is the
More informationCHAPTER 7 GENERAL PROOF SYSTEMS
CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes
More informationRigorous Software Development CSCIGA 3033009
Rigorous Software Development CSCIGA 3033009 Instructor: Thomas Wies Spring 2013 Lecture 11 Semantics of Programming Languages Denotational Semantics Meaning of a program is defined as the mathematical
More informationMinimal R 1, minimal regular and minimal presober topologies
Revista Notas de Matemática Vol.5(1), No. 275, 2009, pp.7384 http://www.saber.ula.ve/notasdematematica/ Comisión de Publicaciones Departamento de Matemáticas Facultad de Ciencias Universidad de Los Andes
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More informationDegrees of Truth: the formal logic of classical and quantum probabilities as well as fuzzy sets.
Degrees of Truth: the formal logic of classical and quantum probabilities as well as fuzzy sets. Logic is the study of reasoning. A language of propositions is fundamental to this study as well as true
More informationCHAPTER 5. Product Measures
54 CHAPTER 5 Product Measures Given two measure spaces, we may construct a natural measure on their Cartesian product; the prototype is the construction of Lebesgue measure on R 2 as the product of Lebesgue
More informationWorkforce scheduling with logical constraints: theory and applications in call centers
Workforce scheduling with logical constraints: theory and applications in call centers Gábor Danó This thesis was supervised by Sandjai Bhulai and Ger Koole Department of Mathematics Vrije Universiteit
More informationWorksheet for Teaching Module Probability (Lesson 1)
Worksheet for Teaching Module Probability (Lesson 1) Topic: Basic Concepts and Definitions Equipment needed for each student 1 computer with internet connection Introduction In the regular lectures in
More informationChapter 2: Systems of Linear Equations and Matrices:
At the end of the lesson, you should be able to: Chapter 2: Systems of Linear Equations and Matrices: 2.1: Solutions of Linear Systems by the Echelon Method Define linear systems, unique solution, inconsistent,
More informationFIXED POINT SETS OF FIBERPRESERVING MAPS
FIXED POINT SETS OF FIBERPRESERVING MAPS Robert F. Brown Department of Mathematics University of California Los Angeles, CA 90095 email: rfb@math.ucla.edu Christina L. Soderlund Department of Mathematics
More informationThe Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationLicensed to: Printed in the United States of America 1 2 3 4 5 6 7 15 14 13 12 11
Licensed to: CengageBrain User This is an electronic version of the print textbook. Due to electronic rights restrictions, some third party content may be suppressed. Editorial review has deemed that any
More informationIf n is odd, then 3n + 7 is even.
Proof: Proof: We suppose... that 3n + 7 is even. that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. that 3n + 7 is even. Since n is odd, there exists an integer k so that
More informationFirstOrder Logics and Truth Degrees
FirstOrder Logics and Truth Degrees George Metcalfe Mathematics Institute University of Bern LATD 2014, Vienna Summer of Logic, 1519 July 2014 George Metcalfe (University of Bern) FirstOrder Logics
More informationOutline. NPcompleteness. When is a problem easy? When is a problem hard? Today. Euler Circuits
Outline NPcompleteness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2pairs sum vs. general Subset Sum Reducing one problem to another Clique
More informationGroup Theory. Contents
Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation
More informationStatistics in Geophysics: Introduction and Probability Theory
Statistics in Geophysics: Introduction and Steffen Unkel Department of Statistics LudwigMaximiliansUniversity Munich, Germany Winter Term 2013/14 1/32 What is Statistics? Introduction Statistics is the
More informationMATH 90 CHAPTER 1 Name:.
MATH 90 CHAPTER 1 Name:. 1.1 Introduction to Algebra Need To Know What are Algebraic Expressions? Translating Expressions Equations What is Algebra? They say the only thing that stays the same is change.
More informationExtra Credit Assignment Lesson plan. The following assignment is optional and can be completed to receive up to 5 points on a previously taken exam.
Extra Credit Assignment Lesson plan The following assignment is optional and can be completed to receive up to 5 points on a previously taken exam. The extra credit assignment is to create a typed up lesson
More informationThe BanachTarski Paradox
University of Oslo MAT2 Project The BanachTarski Paradox Author: Fredrik Meyer Supervisor: Nadia S. Larsen Abstract In its weak form, the BanachTarski paradox states that for any ball in R, it is possible
More information! " # The Logic of Descriptions. Logics for Data and Knowledge Representation. Terminology. Overview. Three Basic Features. Some History on DLs
,!0((,.+#$),%$(&.& *,2($)%&2.'3&%!&, Logics for Data and Knowledge Representation Alessandro Agostini agostini@dit.unitn.it University of Trento Fausto Giunchiglia fausto@dit.unitn.it The Logic of Descriptions!$%&'()*$#)
More informationInformation Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay
Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture  17 ShannonFanoElias Coding and Introduction to Arithmetic Coding
More informationominimality and Uniformity in n 1 Graphs
ominimality and Uniformity in n 1 Graphs Reid Dale July 10, 2013 Contents 1 Introduction 2 2 Languages and Structures 2 3 Definability and Tame Geometry 4 4 Applications to n 1 Graphs 6 5 Further Directions
More informationSome elements of elementary set theory MAT2200 Spring 2011 By Geir Ellingsud
Some elements of elementary set theory MAT2200 Spring 2011 By Geir Ellingsud Most of what this document contains is probably well known to most of you, but still I think it is useful to cast a glance at
More informationTOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS
TOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS VIPUL NAIK Abstract. In this journey, we are going to explore the so called separation axioms in greater detail. We shall try to understand how these axioms
More informationGROUPS ACTING ON A SET
GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for
More informationFoundations of mathematics. 2. Set theory (continued)
2.1. Tuples, amilies Foundations o mathematics 2. Set theory (continued) Sylvain Poirier settheory.net A tuple (or ntuple, or any integer n) is an interpretation o a list o n variables. It is thus a metaunction
More informationLights and Darks of the StarFree Star
Lights and Darks of the StarFree Star Edward Ochmański & Krystyna Stawikowska Nicolaus Copernicus University, Toruń, Poland Introduction: star may destroy recognizability In (finitely generated) trace
More informationA Hajós type result on factoring finite abelian groups by subsets II
Comment.Math.Univ.Carolin. 51,1(2010) 1 8 1 A Hajós type result on factoring finite abelian groups by subsets II Keresztély Corrádi, Sándor Szabó Abstract. It is proved that if a finite abelian group is
More informationNotes on Richard Dedekind s Was sind und was sollen die Zahlen?
Notes on Richard Dedekind s Was sind und was sollen die Zahlen? David E. Joyce, Clark University December 2005 Contents Introduction 2 I. Sets and their elements. 2 II. Functions on a set. 5 III. Onetoone
More informationFirstOrder Theories
FirstOrder Theories Ruzica Piskac Max Planck Institute for Software Systems, Germany piskac@mpisws.org Seminar on Decision Procedures 2012 Ruzica Piskac FirstOrder Theories 1 / 39 Acknowledgments Theories
More information1 Local Brouwer degree
1 Local Brouwer degree Let D R n be an open set and f : S R n be continuous, D S and c R n. Suppose that the set f 1 (c) D is compact. (1) Then the local Brouwer degree of f at c in the set D is defined.
More informationChapter 13: Basic ring theory
Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring
More informationChapter 7: Products and quotients
Chapter 7: Products and quotients Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 7: Products
More informationMAT 113701 College Algebra
MAT 113701 College Algebra Instructor: Dr. Kamal Hennayake Email: kamalhennayake@skipjack.chesapeake.edu I check my email regularly. You may use the above email or Course Email. If you have a question
More informationHIBBING COMMUNITY COLLEGE COURSE OUTLINE
HIBBING COMMUNITY COLLEGE COURSE OUTLINE COURSE NUMBER & TITLE:  Beginning Algebra CREDITS: 4 (Lec 4 / Lab 0) PREREQUISITES: MATH 0920: Fundamental Mathematics with a grade of C or better, Placement Exam,
More informationFIBRATION SEQUENCES AND PULLBACK SQUARES. Contents. 2. Connectivity and fiber sequences. 3
FIRTION SEQUENES ND PULLK SQURES RY MLKIEWIH bstract. We lay out some foundational facts about fibration sequences and pullback squares of topological spaces. We pay careful attention to connectivity ranges
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationA Propositional Dynamic Logic for CCS Programs
A Propositional Dynamic Logic for CCS Programs Mario R. F. Benevides and L. Menasché Schechter {mario,luis}@cos.ufrj.br Abstract This work presents a Propositional Dynamic Logic in which the programs are
More informationThe epistemic structure of de Finetti s betting problem
The epistemic structure of de Finetti s betting problem Tommaso Flaminio 1 and Hykel Hosni 2 1 IIIA  CSIC Campus de la Univ. Autònoma de Barcelona s/n 08193 Bellaterra, Spain. Email: tommaso@iiia.csic.es
More informationComputational Logic and Cognitive Science: An Overview
Computational Logic and Cognitive Science: An Overview Session 1: Logical Foundations Technical University of Dresden 25th of August, 2008 University of Osnabrück Who we are Helmar Gust Interests: Analogical
More informationExamples of Tasks from CCSS Edition Course 3, Unit 5
Examples of Tasks from CCSS Edition Course 3, Unit 5 Getting Started The tasks below are selected with the intent of presenting key ideas and skills. Not every answer is complete, so that teachers can
More informationMODELS OF SET THEORY
MODELS OF SET THEORY STEFAN GESCHKE Contents 1. First order logic and the axioms of set theory 2 1.1. Syntax 2 1.2. Semantics 2 1.3. Completeness, compactness and consistency 3 1.4. Foundations of mathematics
More informationWhich Semantics for Neighbourhood Semantics?
Which Semantics for Neighbourhood Semantics? Carlos Areces INRIA Nancy, Grand Est, France Diego Figueira INRIA, LSV, ENS Cachan, France Abstract In this article we discuss two alternative proposals for
More informationThe Ideal Class Group
Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned
More informationSECTION 2.5: FINDING ZEROS OF POLYNOMIAL FUNCTIONS
SECTION 2.5: FINDING ZEROS OF POLYNOMIAL FUNCTIONS Assume f ( x) is a nonconstant polynomial with real coefficients written in standard form. PART A: TECHNIQUES WE HAVE ALREADY SEEN Refer to: Notes 1.31
More informationRow Ideals and Fibers of Morphisms
Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion
More informationInteger roots of quadratic and cubic polynomials with integer coefficients
Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street
More informationGroup Theory and the Rubik s Cube. Janet Chen
Group Theory and the Rubik s Cube Janet Chen A Note to the Reader These notes are based on a 2week course that I taught for high school students at the Texas State Honors Summer Math Camp. All of the
More informationPrime Numbers and Irreducible Polynomials
Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.
More informationON THE QUESTION "WHO IS A J?"* A Social Choice Approach
ON THE QUESTION "WHO IS A J?"* A Social Choice Approach Asa Kasher** and Ariel Rubinstein*** Abstract The determination of who is a J within a society is treated as an aggregation of the views of the members
More informationCollatz Sequence. Fibbonacci Sequence. n is even; Recurrence Relation: a n+1 = a n + a n 1.
Fibonacci Roulette In this game you will be constructing a recurrence relation, that is, a sequence of numbers where you find the next number by looking at the previous numbers in the sequence. Your job
More informationCODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES
CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES PAUL SHAFER Abstract. We prove that the firstorder theory of the Medvedev degrees, the firstorder theory of the Muchnik degrees, and the thirdorder
More information4. FIRST STEPS IN THE THEORY 4.1. A
4. FIRST STEPS IN THE THEORY 4.1. A Catalogue of All Groups: The Impossible Dream The fundamental problem of group theory is to systematically explore the landscape and to chart what lies out there. We
More information(0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order 4; (1, 0) : order 2; (1, 1) : order 4; (1, 2) : order 2; (1, 3) : order 4.
11.01 List the elements of Z 2 Z 4. Find the order of each of the elements is this group cyclic? Solution: The elements of Z 2 Z 4 are: (0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order
More informationThe core theory of relational databases. Bibliography
The core theory of relational databases Slide 1 La meilleure pratique... c est une bonne théorie Bibliography M.Levene, G.Loizou, Guided Tour of Relational Databases and Beyond, Springer, 625 pages,1999.
More informationCHAPTER 1 BASIC TOPOLOGY
CHAPTER 1 BASIC TOPOLOGY Topology, sometimes referred to as the mathematics of continuity, or rubber sheet geometry, or the theory of abstract topological spaces, is all of these, but, above all, it is
More informationComputational Methods for Database Repair by Signed Formulae
Computational Methods for Database Repair by Signed Formulae Ofer Arieli (oarieli@mta.ac.il) Department of Computer Science, The Academic College of TelAviv, 4 Antokolski street, TelAviv 61161, Israel.
More informationThe Division Algorithm for Polynomials Handout Monday March 5, 2012
The Division Algorithm for Polynomials Handout Monday March 5, 0 Let F be a field (such as R, Q, C, or F p for some prime p. This will allow us to divide by any nonzero scalar. (For some of the following,
More informationUltraproducts and Applications I
Ultraproducts and Applications I Brent Cody Virginia Commonwealth University September 2, 2013 Outline Background of the Hyperreals Filters and Ultrafilters Construction of the Hyperreals The Transfer
More informationAlabama Department of Postsecondary Education
Date Adopted 1998 Dates reviewed 2007, 2011, 2013 Dates revised 2004, 2008, 2011, 2013, 2015 Alabama Department of Postsecondary Education Representing Alabama s Public TwoYear College System Jefferson
More informationModel Checking: An Introduction
Announcements Model Checking: An Introduction Meeting 2 Office hours M 1:30pm2:30pm W 5:30pm6:30pm (after class) and by appointment ECOT 621 Moodle problems? Fundamentals of Programming Languages CSCI
More information