Chapter 4. Basic Set Theory. 4.1 The Language of Set Theory
|
|
- Philomena Hutchinson
- 6 years ago
- Views:
Transcription
1 Chapter 4 Basic Set Theory There are two good reasons for studying set theory. First, it s a indispensable tool for both logic and mathematics, and even for other fields including computer science, linguistics, and so on. But there is also a second reason it s philosophically interesting. For many, the philosophy of mathematics is really just the philosophy of set theory. This is probably a mistaken view, but it is not wholly implausible, since there seems to be counterparts in set theory for all mathematical objects (i.e., numbers are sets, functions are sets, integrals and derivatives are sets, and so on). In any case, familiarity with set theory is essential. 4.1 The Language of Set Theory There are two basic notions, set and member. Strictly speaking these must remain undefined, since otherwise we would end up giving definitions that are either circular or lead to an infinite regress. Nevertheless, we can step outside of the theory and give what Frege called an explication of the concepts. Things such as a flock of birds or a pack of wolves are sets. The individual birds and wolves are members of the sets. Examples such as these help us to get a grip on set and member. But beware. A pack of wolves has a location, whereas a set does not. Sets are abstract entities that exist outside of spacetime. They have no mass, or charge, or shape, or any other physical property. Sometimes it s useful to distinguish a set of bricks that make up a wall from the physical collection of those bricks that make up the wall. The former is located no where and won t harm you, while the latter can give you 27
2 CHAPTER 4. BASIC SET THEORY 28 a nasty bump if you run into it. We will use the symbol for the membership relation, and use A, B, C,..., {},a,b,c,... for both sets and their members. Curley brackets are a common way to specify sets. Thus, {a, b} is the set with the two members a and b. We will define many more important set-theoretical concepts as we move along. Though it is convenient to use upper case letters for sets and lower case for members, sets can be members of other sets; so A B,B a, and a b are perfectly legitimate. We will also use the standard symbols from logic, such as,,,, and so on. We adopt the same formation rules as before, with the following additions. When A is a set and a is a member of it, then the following are wffs: a A, {a} = A, and so on. Exercise 11 Which of the following are wffs? (Don t worry about which are true.) 1. a b 2. A a 3. a {b, c} 4. {b, c} a 5. x X(x X) 6. a/ A (this means (a A)) 7. A 8. a B b A 9. {a, b} = x(x {b, a}) HINTS & ANSWERS 1. yes 2. yes (don t be misled by the letters, A could be a member and a aset) 3. yes
3 CHAPTER 4. BASIC SET THEORY yes 5. yes (we ll let quantifiers range over set variables such as X) 6. yes 7. no (here A is a set, not a sentence) 8. yes 9. no (the left side is a set, the right side is a sentence) 4.2 Axioms Axiom 1 (Extensionality): Two sets are identical, if and only if they have the same members. Symbolically: A B x((x A x B) A = B)) This axiom implies the following: a {a}, {a, b} = {b, a} (order is irrelevant), {a} = {a, a, a, a, a} (there is just one yhing is in the set; repeating it is merely redundant), b 6= a b/ {a}, anda 6= {a} 6= {{a}} 6= {{{a}}} (each of these is a different entity). Axiom 2 (Empty set): There is a set which has no members. A x x/ A (It is usually called the empty set, or the null set, and is denoted φ.) Each of the following is equal to the empty set: φ = the set of humans over 10 feet tall = the set of unicorns = the set of even prime numbers that are greater than 2. You shouldn t think of these as different sets that happen to be empty. There is really only one empty set (and these are different ways of describing it). Theorem 1 The empty set is unique. Proof. Suppose that φ 1 and φ 2 are both empty sets. Because an empty set has no members, it follows that x φ 1 x φ 2. Given the axiom of extensionality, it follows that φ 1 = φ 2. Axiom 3 (Pairing): For any a and b, there is a set which has both of them and nothing else as members. a b A x(x A x = a x = b)
4 CHAPTER 4. BASIC SET THEORY 30 Given that Bob exists and the proposition P exists, then there exists a set containing both of them, {Bob, P}. We can use the axiom again. given that Bob exists and the set {Bob, P} exists, then there exists a set {Bob, {Bob, P}}. Obviously, we can build up all sorts of new sets in this way. Axiom 4 (Union): For any sets A and B, there is a set C whose members are exactly the members of A and B. A B C x (x C x A x B) For example, if A = {a, b, c} and B = {1, 2}, thenthereisasetc, such that C = {a, b, c, 1, 2}. Notation 1 {x : P (x)} means the set of all x such that the condition P(x) holds. (For example, {x : x is red} is the set of all red things; {y : y Z y>27} is the set of all integers that are greater than 27.) Axiom 5 (Comprehension (also know as specification, separation, and aussonderung)): Let U be any set. Then the members of U that satisfy a condition P determine a set. A(A = {x : x U P (x)} If we start with the class members as the set U, andletf mean is a woman and P mean is a philosophy student, then {x : x U Fx Px} is the set of women philosophy students in the class. Exercise 12 Let A = {1, 2, 3,...},B = {x : x is a prime number},c = {a, b, c,..., z},d = x : x is an even number},e = x : x is an odd number}. 1. What is the result of applying the Union Axion to E and D? 2. What is the result of applying the Pairing Axiom to E and D? 3. What is {x : x A x<8}? 4. What is {x : x B x C}? 5. What is {x : x D x E}? ANSWERS: 1. E D = A
5 CHAPTER 4. BASIC SET THEORY {E,D} 3. {1, 2, 3, 4, 5, 6, 7} 4. {a, b, c,..., z, 2, 3, 5, 7, 11, 13,...} 5. A 4.3 Russell s Paradox Let s take a moment to look at Russell s paradox. The axiom of comprehension has the slightly odd form that it does have in order to get around this problem. The current axiom is due to Zermelo, who proposed it to block a number of paradoxes that had arisen in set theory in its early days (in the late 19th and early 20th century). A very natural and intuitive principle of reasoning that was widely used is this: Every condition determines a set. If the condition (or property) is being red then there is a set of red things, and if the condition is being a prime number, then there is a set of prime numbers, and so on. The principle seems completely self-evident. Unfortunately, it leads to a contradiction. (Set theory with this principle is often called naive set theory. ) Notice that some sets seem to be members of themselves and others not. The set of apples, for instance, is not an apple, so it is not a member of itself. On the other hand, the set of abstract entities is an abstract entity, so it would be a member of itself. So far, so good. There is nothing problematic about the conditions being an apple or being an abstract entity. But now consider the condition of being not a member of itself. The set of apples seems to satisfy this condition while the set of abstract entities does not. Let s form the set which corresponds to the condition (that is, the set of all things that are not members of themselves), and call it R. R = {x : x/ x} It looks like a legitimate set. The set of apples will be in R, butthesetof abstract entities will not. Now let s ask the question: Is it true or false that R R? The answer must be either Yes or No. Let s assume Yes: But if R R, thenr {x : x/ x}, and so must satisfy the condition x/ x, so R/ R. Now let s assume No. But if R/ R, thenr does satisfy the condition x/ x, so it must be a
6 CHAPTER 4. BASIC SET THEORY 32 member after all; hence R R. Either assumption leads to its opposite, so we have an outright contraction, R R R/ R. There have been a number of reactions to Russell s paradox. Zermelo s modification of the axiom of comprehension is the most popular. The key idea is that the defining condition is limited to the background set; it is not allowed to apply to everything. After almost 100 years, no one has been able to derive a contradiction. Exercise 13 Try to derive Russell s paradox using the axioms given so far as a way to convincing yourself that Zermelo s modification is plausible. Prior to Zermelo s axiomatization (in 1908), there was thought to be a universal set, that is, a set that contained everything. (Naturally, it would have to contain itself, as well.) This is no longer believed to be the case. The reasoning behind Russell s paradox is used to prove there is no universal set. Theorem 2 There is no universe. That is, U x x U. Proof. Suppose there is a universal set U that contains all sets. Define asetr as follows: R = {x : x U x/ x}. Since U contains everything, R U. By the same reasoning as that involved in Russell s paradox, we have R R R/ R. Since this is a contradiction, we blame the premiss that lead to the absurdity, namely, the assumption that U exists. Thus, there is no such set U. 4.4 Some Key Concepts Using the concepts, axioms, and notation developed so far, we can now define a number of very central concepts. Definition 9 (Union): A B = {x : x A x B} For example, {a, b} {1, 2, 3} = {a, b, 1, 2, 3} Definition 10 (Intersection): A B = {x : x A x B} For example, {a, b} {b, c, 2} = {b} Definition 11 (Subset): A B ( x x A x B) For example, {a, b} {a, b, c}; notice two special cases, A A, φ A
7 CHAPTER 4. BASIC SET THEORY 33 Definition 12 (Proper subset)a B (A B A 6= B) Definition 13 (Difference): A B = {x : x A x/ B} For example, {a, b} {b, c} = {a} Definition 14 (Complement): A 0 = {x : x U x/ A} For example, if U is the set of natural numbers and A is the set of even numbers, then A 0 is the set of odd numbers. Exercise 14 Let U = {1, 2, 3, 4, 5} be the background set and let A = {1, 2}, B = {2, 3}, and C = {3, 4, 5}. What are each of the following? 1. A 0 2. B 0 3. A B 4. A 0 B 0 5. C 0 A 6. U A 7. A U 8. A φ 9. B φ 10. U φ A (A B) B φ Answers: (1) A 0 = {3, 4, 5} = C, (4)A 0 B 0 = {1, 3, 4, 5}, (11)φ 0 = U, (14) B φ = B
8 CHAPTER 4. BASIC SET THEORY More Axioms Axiom 6 (Power Set): For any set A, there is a set whose members are exactly the subsets of A. (The power set of A is usually denoted A.). A B x (x B x A) (Here B is the powerset A) For example, if A = {a, b} then A = {A, φ, {a}, {b}}; and if B = {1, 2, 3}, then B = {B,φ, {1, 2}, {1, 3}, {2, 3}, {1}, {2}, {3}}. Note the special case, φ = {φ}. Notice the pattern. If a set has n members, then its power set has 2 n members. This is why it s called the power set. Exercise 15 (1) What is the powerst of {Bob,Alice}? (2) How many members in the powerset of the alphabet {a, b, c,..., z}? Axiom 7 (Infinity): There is a set with infinitely many members. Sincewehaven tyet defined infinite, the axiom does not really make sense yet. Later we will define it, but for now an intuitive understanding will do. So far I have stated nine axioms. There are more, but we won t be needing them. So I ll only mention some of them: There is the axiom of choice, the axiom of replacement, the axiom of regularity. These are pretty much standard and are in common use by logicians and mathematicians. There are still others, for example, so-called large cardinal axioms, that are quite controversial. These are not part of regular mathematics (at least not yet), but rather are the subject of ongoing research. Now we shall develop some of the key concepts. 4.6 The Algebra of Sets We will now develop the notions of intersection, subset, and so on. This basic part of set theory is known as the algebra of sets. Theorem 3 (Commutative law): A B = B A Proof. x A B x A x B Def x B x A tautology x B A Def
9 CHAPTER 4. BASIC SET THEORY 35 A B = B A Ax. of Extensionality This is a typical proof in the algebra of sets. Notice how it works. We need to show that two sets are identical, which we do by showing that they have exactly the same members. The crucial step in the proof is to use a fact from elementary logic, namely that P Q is equivalent to Q P. A proof does not have to be laid out exactly as above. You may be a bit more or less formal. The crucial point is to include the relevant information in a way that is as clear to the reader as possible. You might find something like this better: Proof. Let us assume that an arbitrary x is a member of the set A B. By the definition of union, this means that x is a member of A or is a member of B. Clearly, this is the same as saying that x is a member of B or x is a member of A. Again, by the definition of union, this means that x is a member of B A. The equality of these two sets follows from the Axiom of Extensionality. Pick the style of writing up proof that you like best. Proofs must be correct. After that make it as easy on your reader as you can. Theorem 4 (Associative laws): Theorem 5 (Distributive laws) Theorem 6 (DeMorgan s laws) A (B C) = (A B) C A (B C) = (A B) C A (B C) = (A B) (A C) A (B C) = (A B) (C B) (A B) 0 = A 0 B 0 (A B) 0 = A 0 B 0
10 CHAPTER 4. BASIC SET THEORY 36 Proof. (of the first) x (A B) 0 x/ A B (x A B) Def / (x A x B) Def x/ A x/ B tautology, Def / x A 0 x B 0 Def 0 x A 0 B 0 Def (A B) 0 = A 0 B 0 Axiom of Extensionality Noticeonceagainthatthekeystepisatransformationinlogic. Inthis proof it is the step from (P Q) to P Q. It is no accident that this equivalence is called De Morgan s in logic as well as in set theory. Theorem 7 A φ = A and A φ = φ Proof. (of the first) x A φ x A x φ Def x A (since x/ φ) A φ = A Axiom of Extensionality Theorem 8 A 00 = A Hint: P P Theorem 9 A B A C B C Proof. A B (x A x B) Def (x A x C x B x C) tautology (x A C x B C) Def A C B C Def Theorem 10 A B A C B C
11 CHAPTER 4. BASIC SET THEORY 37 Theorem 11 A B B 0 A 0 Theorem 12 φ A Hint: P Q is true if P is false. Theorem 13 A A = φ and A φ = A Proof. (of the first) x A A x A x/ A Def x φ (equivalent to a contradiction) A A = φ Axiom of Extensionality Exercise 16 Prove each of the theorems above that were not proven. 4.7 Counter-Examples Theorems, of course, are true for any set whatsoever. A sentence which is not a theorem will have counter-examples, that is, example sets which make the sentence false. Of course, there might be other sets which make it true, in which case the sentence is satisfiable. When faced with a sentence that might be a theorem, try to prove it. If you can t, then try to find a counter-example. For example, we might wonder if A B = A B. To show that it is not atheoremweleta = {a},b = {b}. Then A B = {a} {b} = {a, b}. But A B = {a} {b} = φ 6= A B. So, A and B defined this way provide a counter-example to the alleged theorem. Exercise 17 Prove or give a counter-example to each of the following. 1. A B = B A 2. A 0 B 0 = B 0 A 0 3. A B = B 0 A 4. A B 6= φ A 6= φ 5. A B 6= φ A 6= φ
12 CHAPTER 4. BASIC SET THEORY A C B C A B C 7. (B A) A = A 8. (A B) A = φ 9. (A (B C) =(A B) (A B) 10. (A B B A) A = B Hints and Answers: (4) Counter-example: Let B = {a} and A = φ, then A B = {a} 6= φ, (5) Proof. Suppose A B 6= φ, then x x A B; thus, x A x B. Therefore, A is not empty, ie, A 6= φ. 4.8 Further Reading Enderton, Elements of Set Theory Potter, Set Theory and Its Philosophy Halmos, Naive Set Theory (Thisisagoodshortbook; butitis not naive in the technical sense.)
CM10196 Topic 2: Sets, Predicates, Boolean algebras
CM10196 Topic 2: Sets, Predicates, oolean algebras Guy McCusker 1W2.1 Sets Most of the things mathematicians talk about are built out of sets. The idea of a set is a simple one: a set is just a collection
More informationAxiomatic set theory. Chapter Why axiomatic set theory?
Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its
More informationThis section will take the very naive point of view that a set is a collection of objects, the collection being regarded as a single object.
1.10. BASICS CONCEPTS OF SET THEORY 193 1.10 Basics Concepts of Set Theory Having learned some fundamental notions of logic, it is now a good place before proceeding to more interesting things, such as
More informationRussell s logicism. Jeff Speaks. September 26, 2007
Russell s logicism Jeff Speaks September 26, 2007 1 Russell s definition of number............................ 2 2 The idea of reducing one theory to another.................... 4 2.1 Axioms and theories.............................
More informationLogic and Mathematics:
Logic and Mathematics: Mathematicians in Schools Program Lashi Bandara Mathematical Sciences Institute, Australian National University April 21, 2011 Contents 1 Russell s Paradox 1 2 Propositional Logic
More informationTutorial on Axiomatic Set Theory. Javier R. Movellan
Tutorial on Axiomatic Set Theory Javier R. Movellan Intuitively we think of sets as collections of elements. The crucial part of this intuitive concept is that we are willing to treat sets as entities
More informationChapter 1. Logic and Proof
Chapter 1. Logic and Proof 1.1 Remark: A little over 100 years ago, it was found that some mathematical proofs contained paradoxes, and these paradoxes could be used to prove statements that were known
More informationWe introduce one more operation on sets, perhaps the most important
11. The power set Please accept my resignation. I don t want to belong to any club that will accept me as a member. Groucho Marx We introduce one more operation on sets, perhaps the most important one:
More informationMath 144 Summer 2012 (UCR) Pro-Notes June 24, / 15
Before we start, I want to point out that these notes are not checked for typos. There are prbally many typeos in them and if you find any, please let me know as it s extremely difficult to find them all
More informationToday s topics. Introduction to Set Theory ( 1.6) Naïve set theory. Basic notations for sets
Today s topics Introduction to Set Theory ( 1.6) Sets Definitions Operations Proving Set Identities Reading: Sections 1.6-1.7 Upcoming Functions A set is a new type of structure, representing an unordered
More informationIntroduction to Logic and Axiomatic Set Theory
Introduction to Logic and Axiomatic Set Theory 1 Introduction In mathematics, we seek absolute rigor in our arguments, and a solid foundation for all of the structures we consider. Here, we will see some
More informationFor all For every For each For any There exists at least one There exists There is Some
Section 1.3 Predicates and Quantifiers Assume universe of discourse is all the people who are participating in this course. Also let us assume that we know each person in the course. Consider the following
More informationStudy skills for mathematicians
PART I Study skills for mathematicians CHAPTER 1 Sets and functions Everything starts somewhere, although many physicists disagree. Terry Pratchett, Hogfather, 1996 To think like a mathematician requires
More informationSeminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)
http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product
More informationSequence convergence, the weak T-axioms, and first countability
Sequence convergence, the weak T-axioms, and first countability 1 Motivation Up to now we have been mentioning the notion of sequence convergence without actually defining it. So in this section we will
More informationClass 29 - November 3 Semantics for Predicate Logic
Philosophy 240: Symbolic Logic Fall 2010 Mondays, Wednesdays, Fridays: 9am - 9:50am Hamilton College Russell Marcus rmarcus1@hamilton.edu Class 29 - November 3 Semantics for Predicate Logic I. Proof Theory
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationMAGIC Set theory. lecture 2
MAGIC Set theory lecture 2 David Asperó University of East Anglia 22 October 2014 Recall from last time: Syntactical vs. semantical logical consequence Given a set T of formulas and a formula ', we write
More informationMAGIC Set theory. lecture 1
MAGIC Set theory lecture 1 David Asperó University of East Anglia 15 October 2014 Welcome Welcome to this set theory course. This will be a 10 hour introduction to set theory. The only prerequisite is
More informationINTRODUCTION TO LOGIC
INTRODUCTION TO LOGIC L. MARIZZA A. BAILEY 1. The beginning of Modern Mathematics Before Euclid, there were many mathematicians that made great progress in the knowledge of numbers, algebra and geometry.
More information(1.3.1) and in English one says a is an element of M. The statement that a is not an element of M is written as a M
1.3 Set Theory I As long as the terms of a mathematical theory are names of concrete objects as concrete as mothers breast, the very first object that received a name in human languages - there is not
More informationEquivalent Forms of the Axiom of Infinity
Equivalent Forms of the Axiom of Infinity Axiom of Infinity 1. There is a set that contains each finite ordinal as an element. The Axiom of Infinity is the axiom of Set Theory that explicitly asserts that
More information2. Prime and Maximal Ideals
18 Andreas Gathmann 2. Prime and Maximal Ideals There are two special kinds of ideals that are of particular importance, both algebraically and geometrically: the so-called prime and maximal ideals. Let
More informationRESOLVING RUSSELL S PARADOX WITHIN CANTOR S INTUITIVE SET THEORY. Feng Xu ( Abstract
RESOLVING RUSSELL S PARADOX WITHIN CANTOR S INTUITIVE SET THEORY Feng Xu (e-mail: xtwan@yahoo.com) Abstract The set of all the subsets of a set is its power set, and the cardinality of the power set is
More informationUMASS AMHERST MATH 300 SP 05, F. HAJIR HOMEWORK 8: (EQUIVALENCE) RELATIONS AND PARTITIONS
UMASS AMHERST MATH 300 SP 05, F. HAJIR HOMEWORK 8: (EQUIVALENCE) RELATIONS AND PARTITIONS 1. Relations Recall the concept of a function f from a source set X to a target set Y. It is a rule for mapping
More information4. Sets The language of sets. Describing a Set. c Oksana Shatalov, Fall
c Oksana Shatalov, Fall 2017 1 4. Sets 4.1. The language of sets Set Terminology and Notation Set is a well-defined collection of objects. Elements are objects or members of the set. Describing a Set Roster
More informationHOW TO CREATE A PROOF. Writing proofs is typically not a straightforward, algorithmic process such as calculating
HOW TO CREATE A PROOF ALLAN YASHINSKI Abstract We discuss how to structure a proof based on the statement being proved Writing proofs is typically not a straightforward, algorithmic process such as calculating
More informationLogic. Quantifiers. (real numbers understood). x [x is rotten in Denmark]. x<x+x 2 +1
Logic One reason for studying logic is that we need a better notation than ordinary English for expressing relationships among various assertions or hypothetical states of affairs. A solid grounding in
More information0 Logical Background. 0.1 Sets
0 Logical Background 0.1 Sets In this course we will use the term set to simply mean a collection of things which have a common property such as the totality of positive integers or the collection of points
More informationIntroduction to Logic
Introduction to Logic L. Marizza A. Bailey June 21, 2014 The beginning of Modern Mathematics Before Euclid, there were many mathematicians that made great progress in the knowledge of numbers, algebra
More informationmat.haus project Zurab Janelidze s Lectures on UNIVERSE OF SETS last updated 18 May 2017 Stellenbosch University 2017
Zurab Janelidze s Lectures on UNIVERSE OF SETS last updated 18 May 2017 Stellenbosch University 2017 Contents 1. Axiom-free universe of sets 1 2. Equality of sets and the empty set 2 3. Comprehension and
More informationSets are one of the basic building blocks for the types of objects considered in discrete mathematics.
Section 2.1 Introduction 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
More informationKRIPKE S THEORY OF TRUTH 1. INTRODUCTION
KRIPKE S THEORY OF TRUTH RICHARD G HECK, JR 1. INTRODUCTION The purpose of this note is to give a simple, easily accessible proof of the existence of the minimal fixed point, and of various maximal fixed
More informationElementary constructions on sets
I I I : Elementary constructions on sets In this unit we cover the some fundamental constructions of set theory that are used throughout the mathematical sciences. Much of this material is probably extremely
More information2. Two binary operations (addition, denoted + and multiplication, denoted
Chapter 2 The Structure of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference between
More informationSETS AND FUNCTIONS JOSHUA BALLEW
SETS AND FUNCTIONS JOSHUA BALLEW 1. Sets As a review, we begin by considering a naive look at set theory. For our purposes, we define a set as a collection of objects. Except for certain sets like N, Z,
More informationDirect Proof and Counterexample I:Introduction
Direct Proof and Counterexample I:Introduction Copyright Cengage Learning. All rights reserved. Goal Importance of proof Building up logic thinking and reasoning reading/using definition interpreting :
More informationSet Theory. CSE 215, Foundations of Computer Science Stony Brook University
Set Theory CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 Set theory Abstract set theory is one of the foundations of mathematical thought Most mathematical
More informationDirect Proof and Counterexample I:Introduction. Copyright Cengage Learning. All rights reserved.
Direct Proof and Counterexample I:Introduction Copyright Cengage Learning. All rights reserved. Goal Importance of proof Building up logic thinking and reasoning reading/using definition interpreting statement:
More informationThe theory of numbers
1 AXIOMS FOR THE INTEGERS 1 The theory of numbers UCU Foundations of Mathematics course 2017 Author: F. Beukers 1 Axioms for the integers Roughly speaking, number theory is the mathematics of the integers.
More informationHandout on Logic, Axiomatic Methods, and Proofs MATH Spring David C. Royster UNC Charlotte
Handout on Logic, Axiomatic Methods, and Proofs MATH 3181 001 Spring 1999 David C. Royster UNC Charlotte January 18, 1999 Chapter 1 Logic and the Axiomatic Method 1.1 Introduction Mathematicians use a
More informationIn this initial chapter, you will be introduced to, or more than likely be reminded of, a
1 Sets In this initial chapter, you will be introduced to, or more than likely be reminded of, a fundamental idea that occurs throughout mathematics: sets. Indeed, a set is an object from which every mathematical
More informationWith Question/Answer Animations. Chapter 2
With Question/Answer Animations Chapter 2 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Sequences and Summations Types of
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More informationChapter 1 Review of Equations and Inequalities
Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve
More informationCS 173: Discrete Structures. Eric Shaffer Office Hour: Wed. 1-2, 2215 SC
CS 173: Discrete Structures Eric Shaffer Office Hour: Wed. 1-2, 2215 SC shaffer1@illinois.edu Agenda Sets (sections 2.1, 2.2) 2 Set Theory Sets you should know: Notation you should know: 3 Set Theory -
More informationLecture 4: Constructing the Integers, Rationals and Reals
Math/CS 20: Intro. to Math Professor: Padraic Bartlett Lecture 4: Constructing the Integers, Rationals and Reals Week 5 UCSB 204 The Integers Normally, using the natural numbers, you can easily define
More informationSets. Introduction to Set Theory ( 2.1) Basic notations for sets. Basic properties of sets CMSC 302. Vojislav Kecman
Introduction to Set Theory ( 2.1) VCU, Department of Computer Science CMSC 302 Sets Vojislav Kecman A set is a new type of structure, representing an unordered collection (group, plurality) of zero or
More information2.23 Theorem. Let A and B be sets in a metric space. If A B, then L(A) L(B).
2.23 Theorem. Let A and B be sets in a metric space. If A B, then L(A) L(B). 2.24 Theorem. Let A and B be sets in a metric space. Then L(A B) = L(A) L(B). It is worth noting that you can t replace union
More information(2) Generalize De Morgan s laws for n sets and prove the laws by induction. 1
ARS DIGITA UNIVERSITY MONTH 2: DISCRETE MATHEMATICS PROFESSOR SHAI SIMONSON PROBLEM SET 2 SOLUTIONS SET, FUNCTIONS, BIG-O, RATES OF GROWTH (1) Prove by formal logic: (a) The complement of the union of
More information3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.
1 Chapter 1 Propositional Logic Mathematical logic studies correct thinking, correct deductions of statements from other statements. Let us make it more precise. A fundamental property of a statement is
More informationNondeterministic finite automata
Lecture 3 Nondeterministic finite automata This lecture is focused on the nondeterministic finite automata (NFA) model and its relationship to the DFA model. Nondeterminism is an important concept in the
More informationA BRIEF INTRODUCTION TO ZFC. Contents. 1. Motivation and Russel s Paradox
A BRIEF INTRODUCTION TO ZFC CHRISTOPHER WILSON Abstract. We present a basic axiomatic development of Zermelo-Fraenkel and Choice set theory, commonly abbreviated ZFC. This paper is aimed in particular
More informationTopics in Logic and Proofs
Chapter 2 Topics in Logic and Proofs Some mathematical statements carry a logical value of being true or false, while some do not. For example, the statement 4 + 5 = 9 is true, whereas the statement 2
More informationChapter Summary. Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability
Chapter 2 1 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability Sequences and Summations Types of Sequences Summation
More information2.3 Exercises. (a) F P(A). (Solution)
2.3 Exercises 1. Analyze the logical forms of the following statements. You may use the symbols, /, =,,,,,,, and in your answers, but not,, P,,, {, }, or. (Thus, you must write out the definitions of some
More informationAxioms as definitions: revisiting Hilbert
Axioms as definitions: revisiting Hilbert Laura Fontanella Hebrew University of Jerusalem laura.fontanella@gmail.com 03/06/2016 What is an axiom in mathematics? Self evidence, intrinsic motivations an
More informationDiscrete Basic Structure: Sets
KS091201 MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) Discrete Basic Structure: Sets Discrete Math Team 2 -- KS091201 MD W-07 Outline What is a set? Set properties Specifying a set Often used sets The universal
More informationCHAPTER 10. Gentzen Style Proof Systems for Classical Logic
CHAPTER 10 Gentzen Style Proof Systems for Classical Logic Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. By humans, not mentioning
More information18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015)
18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015) 1. Introduction The goal for this course is to provide a quick, and hopefully somewhat gentle, introduction to the task of formulating
More informationCHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC
CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC 1 Motivation and History The origins of the classical propositional logic, classical propositional calculus, as it was, and still often is called,
More informationMathematical Preliminaries. Sipser pages 1-28
Mathematical Preliminaries Sipser pages 1-28 Mathematical Preliminaries This course is about the fundamental capabilities and limitations of computers. It has 3 parts 1. Automata Models of computation
More informationWriting proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases
Writing proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases September 22, 2018 Recall from last week that the purpose of a proof
More informationChapter III. Basic Proof Techniques. Proving the obvious has never been easy. Marty Rubin
Chapter III Basic Proof Techniques Proving the obvious has never been easy. Marty Rubin The last two chapters were an introduction to the language of mathematics. Knowing the definitions and concepts of
More informationBoolean Algebras. Chapter 2
Chapter 2 Boolean Algebras Let X be an arbitrary set and let P(X) be the class of all subsets of X (the power set of X). Three natural set-theoretic operations on P(X) are the binary operations of union
More informationNotes on Sets for Math 10850, fall 2017
Notes on Sets for Math 10850, fall 2017 David Galvin, University of Notre Dame September 14, 2017 Somewhat informal definition Formally defining what a set is is one of the concerns of logic, and goes
More information1.1 Statements and Compound Statements
Chapter 1 Propositional Logic 1.1 Statements and Compound Statements A statement or proposition is an assertion which is either true or false, though you may not know which. That is, a statement is something
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Jan Stelovsky based on slides by Dr. Baek and Dr. Still Originals by Dr. M. P. Frank and Dr. J.L. Gross Provided by
More informationGÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS. Contents 1. Introduction Gödel s Completeness Theorem
GÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS BEN CHAIKEN Abstract. This paper will discuss the completeness and incompleteness theorems of Kurt Gödel. These theorems have a profound impact on the philosophical
More informationPhilosophy of Religion. Notes on Infinity
Notes on Infinity Infinity in Classical and Medieval Philosophy Aristotle (Metaphysics 986 a 22) reports that limited (peras, πέρας) and unlimited or infinite (apeiron, ἄπειρον) occur as the first pairing
More informationCHAPTER 1. Preliminaries. 1 Set Theory
CHAPTER 1 Preliminaries 1 et Theory We assume that the reader is familiar with basic set theory. In this paragraph, we want to recall the relevant definitions and fix the notation. Our approach to set
More informationSet theory. Math 304 Spring 2007
Math 304 Spring 2007 Set theory Contents 1. Sets 2 1.1. Objects and set formation 2 1.2. Unions and intersections 3 1.3. Differences 4 1.4. Power sets 4 1.5. Ordered pairs and binary,amscdcartesian products
More informationMeta-logic derivation rules
Meta-logic derivation rules Hans Halvorson February 19, 2013 Recall that the goal of this course is to learn how to prove things about (as opposed to by means of ) classical first-order logic. So, we will
More informationCHAPTER 11. Introduction to Intuitionistic Logic
CHAPTER 11 Introduction to Intuitionistic Logic Intuitionistic logic has developed as a result of certain philosophical views on the foundation of mathematics, known as intuitionism. Intuitionism was originated
More informationCountability. 1 Motivation. 2 Counting
Countability 1 Motivation In topology as well as other areas of mathematics, we deal with a lot of infinite sets. However, as we will gradually discover, some infinite sets are bigger than others. Countably
More information3 The language of proof
3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;
More informationSemantics and Generative Grammar. Formal Foundations: A Basic Review of Sets and Functions 1
Formal Foundations: A Basic Review of Sets and Functions 1 1. Naïve Set Theory 1.1 Basic Properties of Sets A set is a group of objects. Any group of objects a, b, c forms a set. (1) Representation of
More informationSupplementary Material for MTH 299 Online Edition
Supplementary Material for MTH 299 Online Edition Abstract This document contains supplementary material, such as definitions, explanations, examples, etc., to complement that of the text, How to Think
More information1 Completeness Theorem for Classical Predicate
1 Completeness Theorem for Classical Predicate Logic The relationship between the first order models defined in terms of structures M = [M, I] and valuations s : V AR M and propositional models defined
More informationPacket #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics
CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus
More information2.1 Definition. Let n be a positive integer. An n-dimensional vector is an ordered list of n real numbers.
2 VECTORS, POINTS, and LINEAR ALGEBRA. At first glance, vectors seem to be very simple. It is easy enough to draw vector arrows, and the operations (vector addition, dot product, etc.) are also easy to
More informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More informationPhilosophy of Mathematics Intuitionism
Philosophy of Mathematics Intuitionism Owen Griffiths oeg21@cam.ac.uk St John s College, Cambridge 01/12/15 Classical mathematics Consider the Pythagorean argument that 2 is irrational: 1. Assume that
More informationCS2742 midterm test 2 study sheet. Boolean circuits: Predicate logic:
x NOT ~x x y AND x /\ y x y OR x \/ y Figure 1: Types of gates in a digital circuit. CS2742 midterm test 2 study sheet Boolean circuits: Boolean circuits is a generalization of Boolean formulas in which
More informationAnalysis I. Classroom Notes. H.-D. Alber
Analysis I Classroom Notes H-D Alber Contents 1 Fundamental notions 1 11 Sets 1 12 Product sets, relations 5 13 Composition of statements 7 14 Quantifiers, negation of statements 9 2 Real numbers 11 21
More informationProving languages to be nonregular
Proving languages to be nonregular We already know that there exist languages A Σ that are nonregular, for any choice of an alphabet Σ. This is because there are uncountably many languages in total and
More information17. Some advanced topics in logic
17. Some advanced topics in logic 17.1 What do we study in advanced logic? Students may imagine that in more advance logic we continue with first order logic, translating more complex sentences and using
More information1 Functions and Sets. 1.1 Sets and Subsets. Phil 450: The Limits of Logic Jeff Russell, Fall 2014
1 Phil 450: The Limits of Logic Jeff Russell, Fall 2014 Any statement that is not an Axiom (Ax) or a Definition (Def) or a Remark (R) or an Example is an Exercise. Unless it says otherwise, the exercise
More informationDiscrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009
Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Our main goal is here is to do counting using functions. For that, we
More information4. Sets The language of sets. Describing a Set. c Oksana Shatalov, Fall Set-builder notation (a more precise way of describing a set)
c Oksana Shatalov, Fall 2018 1 4. Sets 4.1. The language of sets Set Terminology and Notation Set is a well-defined collection of objects. Elements are objects or members of the set. Describing a Set Roster
More informationIntroduction to Metalogic 1
Philosophy 135 Spring 2012 Tony Martin Introduction to Metalogic 1 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: (i) sentence letters p 0, p 1, p 2,... (ii) connectives,
More informationFoundations of Mathematics
Foundations of Mathematics L. Pedro Poitevin 1. Preliminaries 1.1. Sets We will naively think of a set as a collection of mathematical objects, called its elements or members. To indicate that an object
More informationMathematics 114L Spring 2018 D.A. Martin. Mathematical Logic
Mathematics 114L Spring 2018 D.A. Martin Mathematical Logic 1 First-Order Languages. Symbols. All first-order languages we consider will have the following symbols: (i) variables v 1, v 2, v 3,... ; (ii)
More informationMathmatics 239 solutions to Homework for Chapter 2
Mathmatics 239 solutions to Homework for Chapter 2 Old version of 8.5 My compact disc player has space for 5 CDs; there are five trays numbered 1 through 5 into which I load the CDs. I own 100 CDs. a)
More informationThe paradox of knowability, the knower, and the believer
The paradox of knowability, the knower, and the believer Last time, when discussing the surprise exam paradox, we discussed the possibility that some claims could be true, but not knowable by certain individuals
More informationReal Analysis: Part I. William G. Faris
Real Analysis: Part I William G. Faris February 2, 2004 ii Contents 1 Mathematical proof 1 1.1 Logical language........................... 1 1.2 Free and bound variables...................... 3 1.3 Proofs
More informationIntroduction to Proofs
Introduction to Proofs Notes by Dr. Lynne H. Walling and Dr. Steffi Zegowitz September 018 The Introduction to Proofs course is organised into the following nine sections. 1. Introduction: sets and functions
More information1. SET 10/9/2013. Discrete Mathematics Fajrian Nur Adnan, M.CS
1. SET 10/9/2013 Discrete Mathematics Fajrian Nur Adnan, M.CS 1 Discrete Mathematics 1. Set and Logic 2. Relation 3. Function 4. Induction 5. Boolean Algebra and Number Theory MID 6. Graf dan Tree/Pohon
More informationExamples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:
Logic: The Big Picture Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and
More information