Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

Size: px
Start display at page:

Download "Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15"

Transcription

1 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 - by myself. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

2 So what is set theory anyways? Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

3 So what is set theory anyways? A better question is What is mathematics anyways?. Seriously! What is it? We understand what it means to add to get 3, but this process exists only in thought. What, even, does the concept of 2 mean? Do we assume it already exists or does it exist because of some other reason? Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

4 So what is set theory anyways? A better question is What is mathematics anyways?. Seriously! What is it? We understand what it means to add to get 3, but this process exists only in thought. What, even, does the concept of 2 mean? Do we assume it already exists or does it exist because of some other reason? The more advanced we get mathematically, e.g., algebra, calculus, geometry, etc we use concepts like these over and over without ever thinking about where they originated. Is it possible that what we think makes perfect sense to us actually contradicts something else that also makes perfect sense? Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

5 So what is set theory anyways? A better question is What is mathematics anyways?. Seriously! What is it? We understand what it means to add to get 3, but this process exists only in thought. What, even, does the concept of 2 mean? Do we assume it already exists or does it exist because of some other reason? The more advanced we get mathematically, e.g., algebra, calculus, geometry, etc we use concepts like these over and over without ever thinking about where they originated. Is it possible that what we think makes perfect sense to us actually contradicts something else that also makes perfect sense? To answer the question what is set theory? here is an analogy: If modern mathematics is like building a city, then set theory is the very beginning of that city s construction starting with the atoms from which that city is created. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

6 Axioms To build anything, you have to start with something. To build mathematics, we start with the axioms of set theory. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

7 Axioms To build anything, you have to start with something. To build mathematics, we start with the axioms of set theory. Definition (Axiom) An axiom is a starting point of reasoning from which other statements are logically derived. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

8 Axioms To build anything, you have to start with something. To build mathematics, we start with the axioms of set theory. Definition (Axiom) An axiom is a starting point of reasoning from which other statements are logically derived. Unlike theorems, axioms cannot be demonstrated by proof. If they could, they would be called theorems. Axioms are the basic things we accept to be true. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

9 Axioms To build anything, you have to start with something. To build mathematics, we start with the axioms of set theory. Definition (Axiom) An axiom is a starting point of reasoning from which other statements are logically derived. Unlike theorems, axioms cannot be demonstrated by proof. If they could, they would be called theorems. Axioms are the basic things we accept to be true. What we decide to be an axiom is up to us, but classically, they are chosen to be the things that are so self evident that they are accepted without controversy. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

10 The Axioms of Zermelo-Fraenkel Set Theory (ZFC) A widely accepted framework to build modern mathematics are the axioms of Zermelo and Fraenkel (ZF). In 1908 Zermelo introduced the axioms and in 1922 Fraenkel added the additional axiom of replacement for which Zermelo later admitted to forgetting to include in his work. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

11 The Axioms of Zermelo-Fraenkel Set Theory (ZFC) A widely accepted framework to build modern mathematics are the axioms of Zermelo and Fraenkel (ZF). In 1908 Zermelo introduced the axioms and in 1922 Fraenkel added the additional axiom of replacement for which Zermelo later admitted to forgetting to include in his work. The axiom of choice (AC) is one of the most controversial axioms of set theory. In this class, we will develop as much as possible only using ZF, but at some point we will assume AC. ZF with AC is called Zermelo-Fraenkel with choice (ZFC). We will see why AC is controversial and I will leave it up to you to decide on if you accept it or not. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

12 Sets Sets are a collection of objects. These objects are called elements of the set. NOTE: A set is not the objects themselves but the collection as a whole. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

13 Sets Sets are a collection of objects. These objects are called elements of the set. NOTE: A set is not the objects themselves but the collection as a whole. One of the defining characteristics of ZF is that everything is a set, that is, sets will contain objects, but these objects are also sets, etc. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

14 Sets Sets are a collection of objects. These objects are called elements of the set. NOTE: A set is not the objects themselves but the collection as a whole. One of the defining characteristics of ZF is that everything is a set, that is, sets will contain objects, but these objects are also sets, etc. Sets don t have a formal definition - they exist because the axioms of ZF say they exist. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

15 Sets Sets are a collection of objects. These objects are called elements of the set. NOTE: A set is not the objects themselves but the collection as a whole. One of the defining characteristics of ZF is that everything is a set, that is, sets will contain objects, but these objects are also sets, etc. Sets don t have a formal definition - they exist because the axioms of ZF say they exist. On the other hand, to give a definition, we need to make sure that the set that is being defined exists, that is, we cannot create sets from definitions. In other words, definitions give names to things that are already there. In addition, we do not want to give a single name to multiple things, that is, we need to make sure our definitions are well defined. This will come up over and over again. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

16 ZF Axiom (1. The Axiom Of Existence) There exists a set which has no elements. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

17 ZF Axiom (1. The Axiom Of Existence) There exists a set which has no elements. This is the only axiom we will have where we claim something out of thin air exists. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

18 ZF Axiom (1. The Axiom Of Existence) There exists a set which has no elements. This is the only axiom we will have where we claim something out of thin air exists. In logical symbols this axiom can be written as Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

19 ZF Axiom (1. The Axiom Of Existence) There exists a set which has no elements. This is the only axiom we will have where we claim something out of thin air exists. In logical symbols this axiom can be written as x y(y / x) Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

20 ZF Axiom (1. The Axiom Of Existence) There exists a set which has no elements. This is the only axiom we will have where we claim something out of thin air exists. In logical symbols this axiom can be written as x y(y / x) You might ask Why do we assume there exists a set with no elements? Why not just assume there exists a set. Well, we could have done that and with a later axiom we could prove that there exists a set that has no elements. However, from a minimalist point of view, the set with no elements seems the best to start with. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

21 ZF First question: Is there more than one set that contains no elements? Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

22 ZF First question: Is there more than one set that contains no elements? At this point, we can t answer this question we need another axiom Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

23 ZF Axiom (2. The Axiom of Extension) If two sets X and Y have the same elements, then X = Y. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

24 ZF Axiom (2. The Axiom of Extension) If two sets X and Y have the same elements, then X = Y. The more common way of saying this is: If every element of X is an element of Y, and every element of Y is an element of X then X = Y. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

25 ZF Axiom (2. The Axiom of Extension) If two sets X and Y have the same elements, then X = Y. The more common way of saying this is: If every element of X is an element of Y, and every element of Y is an element of X then X = Y. You might ask why even bother saying this as it sounds so obvious. Well, up until this point, we did not have a definition of what = means. Now we do. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

26 ZF Axiom (2. The Axiom of Extension) If two sets X and Y have the same elements, then X = Y. The more common way of saying this is: If every element of X is an element of Y, and every element of Y is an element of X then X = Y. You might ask why even bother saying this as it sounds so obvious. Well, up until this point, we did not have a definition of what = means. Now we do. In symbols this is written as X Y ( y Y (y X ) x X (x Y ) X = Y ) Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

27 ZF We can now answer the previous question: There is, in fact, only one set that contains no elements Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

28 ZF We can now answer the previous question: There is, in fact, only one set that contains no elements Proof. Suppose there are two sets X and Y that have no elements. It is a true statement to say: x X x Y. because x X is a false statement (see truth tables for ). It is also the case that y Y y X for the same reason. By the axiom of extension X = Y and therefore there is only set that contains no elements. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

29 Therefore, by the axiom of extension and the axiom of existence we can now make a definition: Definition (The empty set) The set that contains no elements will be called the empty set and denoted by the symbol or sometimes by {}. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

30 Therefore, by the axiom of extension and the axiom of existence we can now make a definition: Definition (The empty set) The set that contains no elements will be called the empty set and denoted by the symbol or sometimes by {}. Notice this definition is giving a name to the set that has no elements. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

31 Therefore, by the axiom of extension and the axiom of existence we can now make a definition: Definition (The empty set) The set that contains no elements will be called the empty set and denoted by the symbol or sometimes by {}. Notice this definition is giving a name to the set that has no elements. Until now, it was not logical to make the above definition. We had no yet answered the question of is there more than one set that contains no elements? We don t want to call multiple things by a single name. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

32 The axiom of extension also tells us about repetition of objects in a single set: Example Prove that the set {A, A} = {A}. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

33 The axiom of extension also tells us about repetition of objects in a single set: Example Prove that the set {A, A} = {A}. Proof. Consider the statement x {A, A}. The only thing x can be is A and since A {A} it is true to say x {A, A}(x {A}). Similarly, x {A}, (x {A, A}). So by the axiom of extension {A, A} = {A}. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

34 Russell s Paradox So we know the empty set exists and we know how to tell when two sets are equal. How do we get our hands on more sets? Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

35 Russell s Paradox So we know the empty set exists and we know how to tell when two sets are equal. How do we get our hands on more sets? Intuition tells us that the elements of a set should be defined by a property those elements should have. For a given property P(x) that an arbitrary element x should have, we should get a set S that contains all elements x that have property P(x). Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

36 Russell s Paradox So we know the empty set exists and we know how to tell when two sets are equal. How do we get our hands on more sets? Intuition tells us that the elements of a set should be defined by a property those elements should have. For a given property P(x) that an arbitrary element x should have, we should get a set S that contains all elements x that have property P(x). In other words, we want to say is a set! S := {x P(x)} Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

37 Russell s Paradox So we know the empty set exists and we know how to tell when two sets are equal. How do we get our hands on more sets? Intuition tells us that the elements of a set should be defined by a property those elements should have. For a given property P(x) that an arbitrary element x should have, we should get a set S that contains all elements x that have property P(x). In other words, we want to say is a set! S := {x P(x)} There is a subtle problem with this idea. It s called Russell s Paradox Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

38 Russell s Paradox In 1901, Bertrand Russell pointed out the following paradox by defining a set R = {x x / x} Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

39 Russell s Paradox In 1901, Bertrand Russell pointed out the following paradox by defining a set R = {x x / x} Notice here that the property P(x) is that the set x is not an element of itself. I agree, that is a strange property, but still, it s a property. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

40 Russell s Paradox In 1901, Bertrand Russell pointed out the following paradox by defining a set R = {x x / x} Notice here that the property P(x) is that the set x is not an element of itself. I agree, that is a strange property, but still, it s a property. Now let s ask is R R? Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

41 Russell s Paradox In 1901, Bertrand Russell pointed out the following paradox by defining a set R = {x x / x} Notice here that the property P(x) is that the set x is not an element of itself. I agree, that is a strange property, but still, it s a property. Now let s ask is R R? Well if R R then R must have the property that R / R so that can t be. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

42 Russell s Paradox In 1901, Bertrand Russell pointed out the following paradox by defining a set R = {x x / x} Notice here that the property P(x) is that the set x is not an element of itself. I agree, that is a strange property, but still, it s a property. Now let s ask is R R? Well if R R then R must have the property that R / R so that can t be. The other option is that R / R. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

43 Russell s Paradox In 1901, Bertrand Russell pointed out the following paradox by defining a set R = {x x / x} Notice here that the property P(x) is that the set x is not an element of itself. I agree, that is a strange property, but still, it s a property. Now let s ask is R R? Well if R R then R must have the property that R / R so that can t be. The other option is that R / R. If R / R, then R is a set that has the property that it s not an element of itself. But then R R by definition of R so that can t be either. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

44 ZF So no matter what way we look at this set there is a problem with it s definition. This problem is solved in ZF set by the following: Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

45 ZF So no matter what way we look at this set there is a problem with it s definition. This problem is solved in ZF set by the following: Axiom (3. The Axiom of Comprhension) Let P(x) be a property of x. For every set A, there is a set S such that x is an element of S if and only if x A and P(x). Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

46 ZF So no matter what way we look at this set there is a problem with it s definition. This problem is solved in ZF set by the following: Axiom (3. The Axiom of Comprhension) Let P(x) be a property of x. For every set A, there is a set S such that x is an element of S if and only if x A and P(x). Secretly, this axiom tells us that subsets are also sets. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

47 ZF So no matter what way we look at this set there is a problem with it s definition. This problem is solved in ZF set by the following: Axiom (3. The Axiom of Comprhension) Let P(x) be a property of x. For every set A, there is a set S such that x is an element of S if and only if x A and P(x). Secretly, this axiom tells us that subsets are also sets. This also tells us how to define sets by properties, i.e., the axiom of comprehension says for any property P(x) and any set A is a set! S := {x A P(x)} Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

48 In symbols the axiom of comprehension can be written as A S x (x S x A P(x)) Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

49 In symbols the axiom of comprehension can be written as A S x (x S x A P(x)) The important statement to take away from the above is S. The axiom of comprehension tells us that if we define things in this way, S is a set. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

50 In symbols the axiom of comprehension can be written as A S x (x S x A P(x)) The important statement to take away from the above is S. The axiom of comprehension tells us that if we define things in this way, S is a set. Remember, the point of these axioms is to give precise instructions on what is and what is not a set. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

51 In symbols the axiom of comprehension can be written as A S x (x S x A P(x)) The important statement to take away from the above is S. The axiom of comprehension tells us that if we define things in this way, S is a set. Remember, the point of these axioms is to give precise instructions on what is and what is not a set. Now notice Russell s Paradox is avoided by requiring, first A to be a set, and then setting S A. Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

Now, with all the definitions we ve made, we re ready see where all the math stuff we took for granted, like numbers, come from.

Now, with all the definitions we ve made, we re ready see where all the math stuff we took for granted, like numbers, come from. The Natural Numbers Now, with all the definitions we ve made, we re ready see where all the math stuff we took for granted, like numbers, come from. Math 144 Summer 2012 (UCR) Pro-Notes July 6, 2012 1

More information

Introduction to Logic and Axiomatic Set Theory

Introduction 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 information

Tutorial on Axiomatic Set Theory. Javier R. Movellan

Tutorial 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 information

Axiomatic set theory. Chapter Why axiomatic set theory?

Axiomatic 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 information

CM10196 Topic 2: Sets, Predicates, Boolean algebras

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 information

Topic 1: Propositional logic

Topic 1: Propositional logic Topic 1: Propositional logic Guy McCusker 1 1 University of Bath Logic! This lecture is about the simplest kind of mathematical logic: propositional calculus. We discuss propositions, which are statements

More information

Chapter 4. Basic Set Theory. 4.1 The Language of Set Theory

Chapter 4. Basic Set Theory. 4.1 The Language of Set Theory 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,

More information

This 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.

This 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 information

We introduce one more operation on sets, perhaps the most important

We 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 information

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)

Seminaar 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 information

Chapter 1. Logic and Proof

Chapter 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 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.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 information

MAGIC Set theory. lecture 2

MAGIC 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 information

2. Prime and Maximal Ideals

2. 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 information

Gödel s Proof. Henrik Jeldtoft Jensen Dept. of Mathematics Imperial College. Kurt Gödel

Gödel s Proof. Henrik Jeldtoft Jensen Dept. of Mathematics Imperial College. Kurt Gödel Gödel s Proof Henrik Jeldtoft Jensen Dept. of Mathematics Imperial College Kurt Gödel 24.4.06-14.1.78 1 ON FORMALLY UNDECIDABLE PROPOSITIONS OF PRINCIPIA MATHEMATICA AND RELATED SYSTEMS 11 by Kurt Gödel,

More information

Russell s logicism. Jeff Speaks. September 26, 2007

Russell 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 information

Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 15 Propositional Calculus (PC)

Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 15 Propositional Calculus (PC) Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras Lecture - 15 Propositional Calculus (PC) So, now if you look back, you can see that there are three

More information

2.3 Exercises. (a) F P(A). (Solution)

2.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 information

HOW TO WRITE PROOFS. Dr. Min Ru, University of Houston

HOW TO WRITE PROOFS. Dr. Min Ru, University of Houston HOW TO WRITE PROOFS Dr. Min Ru, University of Houston One of the most difficult things you will attempt in this course is to write proofs. A proof is to give a legal (logical) argument or justification

More information

Gödel s Incompleteness Theorem. Overview. Computability and Logic

Gödel s Incompleteness Theorem. Overview. Computability and Logic Gödel s Incompleteness Theorem Overview Computability and Logic Recap Remember what we set out to do in this course: Trying to find a systematic method (algorithm, procedure) which we can use to decide,

More information

Zermelo-Fraenkel Set Theory

Zermelo-Fraenkel Set Theory Zermelo-Fraenkel Set Theory Zak Mesyan University of Colorado Colorado Springs The Real Numbers In the 19th century attempts to prove facts about the real numbers were limited by the lack of a rigorous

More information

Chapter 1 Review of Equations and Inequalities

Chapter 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 information

1 FUNDAMENTALS OF LOGIC NO.1 WHAT IS LOGIC Tatsuya Hagino hagino@sfc.keio.ac.jp lecture URL https://vu5.sfc.keio.ac.jp/slide/ 2 Course Summary What is the correct deduction? Since A, therefore B. It is

More information

The Reflection Theorem

The Reflection Theorem The Reflection Theorem Formalizing Meta-Theoretic Reasoning Lawrence C. Paulson Computer Laboratory Lecture Overview Motivation for the Reflection Theorem Proving the Theorem in Isabelle Applying the Reflection

More information

The Search for the Perfect Language

The Search for the Perfect Language The Search for the Perfect Language I'll tell you how the search for certainty led to incompleteness, uncomputability & randomness, and the unexpected result of the search for the perfect language. Bibliography

More information

One sided tests. An example of a two sided alternative is what we ve been using for our two sample tests:

One sided tests. An example of a two sided alternative is what we ve been using for our two sample tests: One sided tests So far all of our tests have been two sided. While this may be a bit easier to understand, this is often not the best way to do a hypothesis test. One simple thing that we can do to get

More information

RESOLVING RUSSELL S PARADOX WITHIN CANTOR S INTUITIVE SET THEORY. Feng Xu ( Abstract

RESOLVING 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 information

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1) Week 1: Logic Lecture 1, 8/1 (Sections 1.1 and 1.3) Examples of theorems and proofs Theorem (Pythagoras). Let ABC be a right triangle, with legs of lengths a and b, and hypotenuse of length c. Then a +

More information

Lecture 5 : Proofs DRAFT

Lecture 5 : Proofs DRAFT CS/Math 240: Introduction to Discrete Mathematics 2/3/2011 Lecture 5 : Proofs Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Up until now, we have been introducing mathematical notation

More information

CS2742 midterm test 2 study sheet. Boolean circuits: Predicate logic:

CS2742 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 information

With Question/Answer Animations. Chapter 2

With 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 information

Gödel s Incompleteness Theorem. Overview. Computability and Logic

Gödel s Incompleteness Theorem. Overview. Computability and Logic Gödel s Incompleteness Theorem Overview Computability and Logic Recap Remember what we set out to do in this course: Trying to find a systematic method (algorithm, procedure) which we can use to decide,

More information

On the scope of diagonal argument and on contradictory equivalence.

On the scope of diagonal argument and on contradictory equivalence. Daniil Teplitskiy, Russia, Saint Petersburg PSI Co. Ltd. 24JUN2011 To my teachers and good people Isaak Perchenok and Rustem Valeyev. To my friend Aleksey Kiselev whose intellectual paradigm underlies

More information

Sec$on Summary. Definition of sets Describing Sets

Sec$on Summary. Definition of sets Describing Sets Section 2.1 Sec$on Summary Definition of sets Describing Sets Roster Method Set-Builder Notation Some Important Sets in Mathematics Empty Set and Universal Set Subsets and Set Equality Cardinality of Sets

More information

Set Theory History. Martin Bunder. September 2015

Set Theory History. Martin Bunder. September 2015 Set Theory History Martin Bunder September 2015 What is a set? Possible Definition A set is a collection of elements having a common property Abstraction Axiom If a(x) is a property ( y)( x)(x y a(x))

More information

Russell s Paradox, Our Solution, and the Other Solutions

Russell s Paradox, Our Solution, and the Other Solutions International Journal of Theoretical and Applied Mathematics 2016; 2(2): 110-114 http://www.sciencepublishinggroup.com/j/ijtam doi: 10.11648/j.ijtam.20160202.22 Russell s Paradox, Our Solution, and the

More information

Introduction to Logic

Introduction 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 information

Axioms as definitions: revisiting Hilbert

Axioms 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 information

We have seen that the symbols,,, and can guide the logical

We have seen that the symbols,,, and can guide the logical CHAPTER 7 Quantified Statements We have seen that the symbols,,, and can guide the logical flow of algorithms. We have learned how to use them to deconstruct many English sentences into a symbolic form.

More information

INDEPENDENCE OF THE CONTINUUM HYPOTHESIS

INDEPENDENCE OF THE CONTINUUM HYPOTHESIS INDEPENDENCE OF THE CONTINUUM HYPOTHESIS CAPSTONE MATT LUTHER 1 INDEPENDENCE OF THE CONTINUUM HYPOTHESIS 2 1. Introduction This paper will summarize many of the ideas from logic and set theory that are

More information

INTRODUCTION TO LOGIC

INTRODUCTION 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

Math 300 Introduction to Mathematical Reasoning Autumn 2017 Inverse Functions

Math 300 Introduction to Mathematical Reasoning Autumn 2017 Inverse Functions Math 300 Introduction to Mathematical Reasoning Autumn 2017 Inverse Functions Please read this pdf in place of Section 6.5 in the text. The text uses the term inverse of a function and the notation f 1

More information

Solution to Proof Questions from September 1st

Solution to Proof Questions from September 1st Solution to Proof Questions from September 1st Olena Bormashenko September 4, 2011 What is a proof? A proof is an airtight logical argument that proves a certain statement in general. In a sense, it s

More information

Mathematical Logic Part Three

Mathematical Logic Part Three Mathematical Logic Part Three Recap from Last Time What is First-Order Logic? First-order logic is a logical system for reasoning about properties of objects. Augments the logical connectives from propositional

More information

Section 3.1: Direct Proof and Counterexample 1

Section 3.1: Direct Proof and Counterexample 1 Section 3.1: Direct Proof and Counterexample 1 In this chapter, we introduce the notion of proof in mathematics. A mathematical proof is valid logical argument in mathematics which shows that a given conclusion

More information

WORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:

WORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers: WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their

More information

Logic, Sets, and Proofs

Logic, 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 information

Math 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10

Math 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10 Math 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10 Inductive sets (used to define the natural numbers as a subset of R) (1) Definition: A set S R is an inductive

More information

CHAPTER 0: BACKGROUND (SPRING 2009 DRAFT)

CHAPTER 0: BACKGROUND (SPRING 2009 DRAFT) CHAPTER 0: BACKGROUND (SPRING 2009 DRAFT) MATH 378, CSUSM. SPRING 2009. AITKEN This chapter reviews some of the background concepts needed for Math 378. This chapter is new to the course (added Spring

More information

Logic and Mathematics:

Logic 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 information

Descriptive Statistics (And a little bit on rounding and significant digits)

Descriptive Statistics (And a little bit on rounding and significant digits) Descriptive Statistics (And a little bit on rounding and significant digits) Now that we know what our data look like, we d like to be able to describe it numerically. In other words, how can we represent

More information

CSCI3390-Lecture 6: An Undecidable Problem

CSCI3390-Lecture 6: An Undecidable Problem CSCI3390-Lecture 6: An Undecidable Problem September 21, 2018 1 Summary The language L T M recognized by the universal Turing machine is not decidable. Thus there is no algorithm that determines, yes or

More information

Sets are one of the basic building blocks for the types of objects considered in discrete mathematics.

Sets 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 information

CITS2211 Discrete Structures (2017) Cardinality and Countability

CITS2211 Discrete Structures (2017) Cardinality and Countability CITS2211 Discrete Structures (2017) Cardinality and Countability Highlights What is cardinality? Is it the same as size? Types of cardinality and infinite sets Reading Sections 45 and 81 84 of Mathematics

More information

Victoria Gitman and Thomas Johnstone. New York City College of Technology, CUNY

Victoria Gitman and Thomas Johnstone. New York City College of Technology, CUNY Gödel s Proof Victoria Gitman and Thomas Johnstone New York City College of Technology, CUNY vgitman@nylogic.org http://websupport1.citytech.cuny.edu/faculty/vgitman tjohnstone@citytech.cuny.edu March

More information

Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur. Lecture 1 Real Numbers

Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur. Lecture 1 Real Numbers Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur Lecture 1 Real Numbers In these lectures, we are going to study a branch of mathematics called

More information

Lecture 6: Finite Fields

Lecture 6: Finite Fields CCS Discrete Math I Professor: Padraic Bartlett Lecture 6: Finite Fields Week 6 UCSB 2014 It ain t what they call you, it s what you answer to. W. C. Fields 1 Fields In the next two weeks, we re going

More information

(ADVANCED) PROOF AND COMPUTATION. Semester II 2015/ Introduction

(ADVANCED) PROOF AND COMPUTATION. Semester II 2015/ Introduction Semester II 2015/2016 1. Introduction 1.1. Hilbert's Program. At the end of the 19th century, Cantor and Frege developed naive set theory, which was supposed to allow to treat sets as actual mathematical

More information

12. INFINITE ABELIAN GROUPS

12. INFINITE ABELIAN GROUPS 12. INFINITE ABELIAN GROUPS 12.1. Examples of Infinite Abelian Groups Many of the groups which arise in various parts of mathematics are abelian. That is, they satisfy the commutative law: xy = yx. If

More information

A BRIEF INTRODUCTION TO ZFC. Contents. 1. Motivation and Russel s Paradox

A 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 information

Math 5801 General Topology and Knot Theory

Math 5801 General Topology and Knot Theory Lecture 2-8/24/2012 Math 5801 Ohio State University August 24, 2012 Course Info Textbook (required) J. R. Munkres, Topology (2nd Edition), Prentice Hall, Englewood Cliffs, NJ, 2000. ISBN-10: 0131816292

More information

Math 38: Graph Theory Spring 2004 Dartmouth College. On Writing Proofs. 1 Introduction. 2 Finding A Solution

Math 38: Graph Theory Spring 2004 Dartmouth College. On Writing Proofs. 1 Introduction. 2 Finding A Solution Math 38: Graph Theory Spring 2004 Dartmouth College 1 Introduction On Writing Proofs What constitutes a well-written proof? A simple but rather vague answer is that a well-written proof is both clear and

More information

INTRODUCTION TO CARDINAL NUMBERS

INTRODUCTION TO CARDINAL NUMBERS INTRODUCTION TO CARDINAL NUMBERS TOM CUCHTA 1. Introduction This paper was written as a final project for the 2013 Summer Session of Mathematical Logic 1 at Missouri S&T. We intend to present a short discussion

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 20. To Infinity And Beyond: Countability and Computability

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 20. To Infinity And Beyond: Countability and Computability EECS 70 Discrete Mathematics and Probability Theory Spring 014 Anant Sahai Note 0 To Infinity And Beyond: Countability and Computability This note ties together two topics that might seem like they have

More information

Lecture 1. Econ 2001: Introduction to Mathematical Methods (a.k.a. Math Camp) 2015 August 10

Lecture 1. Econ 2001: Introduction to Mathematical Methods (a.k.a. Math Camp) 2015 August 10 Lecture 1 Econ 2001: Introduction to Mathematical Methods (a.k.a. Math Camp) 2015 August 10 Lecture 1 Outline 1 Logistics: Who, Where, When, What, How, Why, Stuff 2 Methods of Proof 3 Sets 4 Binary Relations

More information

Extensions to the Logic of All x are y: Verbs, Relative Clauses, and Only

Extensions to the Logic of All x are y: Verbs, Relative Clauses, and Only 1/53 Extensions to the Logic of All x are y: Verbs, Relative Clauses, and Only Larry Moss Indiana University Nordic Logic School August 7-11, 2017 2/53 An example that we ll see a few times Consider the

More information

Informal Statement Calculus

Informal Statement Calculus FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example

More information

Mathematical Logic Part One

Mathematical Logic Part One Mathematical Logic Part One Question: How do we formalize the definitions and reasoning we use in our proofs? Where We're Going Propositional Logic (oday) Basic logical connectives. ruth tables. Logical

More information

/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Matroids and Greedy Algorithms Date: 10/31/16

/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Matroids and Greedy Algorithms Date: 10/31/16 60.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Matroids and Greedy Algorithms Date: 0/3/6 6. Introduction We talked a lot the last lecture about greedy algorithms. While both Prim

More information

173 Logic and Prolog 2013 With Answers and FFQ

173 Logic and Prolog 2013 With Answers and FFQ 173 Logic and Prolog 2013 With Answers and FFQ Please write your name on the bluebook. You may have two sides of handwritten notes. There are 75 points (minutes) total. Stay cool and please write neatly.

More information

Lecture 11: Gödel s Second Incompleteness Theorem, and Tarski s Theorem

Lecture 11: Gödel s Second Incompleteness Theorem, and Tarski s Theorem Lecture 11: Gödel s Second Incompleteness Theorem, and Tarski s Theorem Valentine Kabanets October 27, 2016 1 Gödel s Second Incompleteness Theorem 1.1 Consistency We say that a proof system P is consistent

More information

To Infinity and Beyond

To Infinity and Beyond To Infinity and Beyond 25 January 2012 To Infinity and Beyond 25 January 2012 1/24 The concept of infinity has both fascinated and frustrated people for millenia. We will discuss some historical problems

More information

Math 10850, fall 2017, University of Notre Dame

Math 10850, fall 2017, University of Notre Dame Math 10850, fall 2017, University of Notre Dame Notes on first exam September 22, 2017 The key facts The first midterm will be on Thursday, September 28, 6.15pm-7.45pm in Hayes-Healy 127. What you need

More information

One-to-one functions and onto functions

One-to-one functions and onto functions MA 3362 Lecture 7 - One-to-one and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of one-to-one and onto One-to-one functions and onto functions At the level of set theory, there are

More information

What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos

What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos armandobcm@yahoo.com February 5, 2014 Abstract This note is for personal use. It

More information

2. Introduction to commutative rings (continued)

2. Introduction to commutative rings (continued) 2. Introduction to commutative rings (continued) 2.1. New examples of commutative rings. Recall that in the first lecture we defined the notions of commutative rings and field and gave some examples of

More information

Lecture Notes on Compositional Reasoning

Lecture Notes on Compositional Reasoning 15-414: Bug Catching: Automated Program Verification Lecture Notes on Compositional Reasoning Matt Fredrikson Ruben Martins Carnegie Mellon University Lecture 4 1 Introduction This lecture will focus on

More information

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

More information

Notes on Sets for Math 10850, fall 2017

Notes 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 information

MITOCW ocw-18_02-f07-lec02_220k

MITOCW ocw-18_02-f07-lec02_220k MITOCW ocw-18_02-f07-lec02_220k The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free.

More information

Why is the Universe Described in Mathematics? This essay attempts to address the questions, "Why is the Universe described in

Why is the Universe Described in Mathematics? This essay attempts to address the questions, Why is the Universe described in Connelly Barnes Why is the Universe Described in Mathematics? This essay attempts to address the questions, "Why is the Universe described in mathematics?" and "Is mathematics a human creation, specific

More information

Introduction to Proofs

Introduction to Proofs Introduction to Proofs Many times in economics we will need to prove theorems to show that our theories can be supported by speci c assumptions. While economics is an observational science, we use mathematics

More information

The paradox of knowability, the knower, and the believer

The 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 information

Syllogistic Logic and its Extensions

Syllogistic Logic and its Extensions 1/31 Syllogistic Logic and its Extensions Larry Moss, Indiana University NASSLLI 2014 2/31 Logic and Language: Traditional Syllogisms All men are mortal. Socrates is a man. Socrates is mortal. Some men

More information

Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur

Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Lecture 02 Groups: Subgroups and homomorphism (Refer Slide Time: 00:13) We looked

More information

Math 4603: Advanced Calculus I, Summer 2016 University of Minnesota Notes on Cardinality of Sets

Math 4603: Advanced Calculus I, Summer 2016 University of Minnesota Notes on Cardinality of Sets Math 4603: Advanced Calculus I, Summer 2016 University of Minnesota Notes on Cardinality of Sets Introduction In this short article, we will describe some basic notions on cardinality of sets. Given two

More information

Supplementary Logic Notes CSE 321 Winter 2009

Supplementary Logic Notes CSE 321 Winter 2009 1 Propositional Logic Supplementary Logic Notes CSE 321 Winter 2009 1.1 More efficient truth table methods The method of using truth tables to prove facts about propositional formulas can be a very tedious

More information

Propositional natural deduction

Propositional natural deduction Propositional natural deduction COMP2600 / COMP6260 Dirk Pattinson Australian National University Semester 2, 2016 Major proof techniques 1 / 25 Three major styles of proof in logic and mathematics Model

More information

Understanding Exponents Eric Rasmusen September 18, 2018

Understanding Exponents Eric Rasmusen September 18, 2018 Understanding Exponents Eric Rasmusen September 18, 2018 These notes are rather long, but mathematics often has the perverse feature that if someone writes a long explanation, the reader can read it much

More information

Model Theory MARIA MANZANO. University of Salamanca, Spain. Translated by RUY J. G. B. DE QUEIROZ

Model Theory MARIA MANZANO. University of Salamanca, Spain. Translated by RUY J. G. B. DE QUEIROZ Model Theory MARIA MANZANO University of Salamanca, Spain Translated by RUY J. G. B. DE QUEIROZ CLARENDON PRESS OXFORD 1999 Contents Glossary of symbols and abbreviations General introduction 1 xix 1 1.0

More information

Math 3361-Modern Algebra Lecture 08 9/26/ Cardinality

Math 3361-Modern Algebra Lecture 08 9/26/ Cardinality Math 336-Modern Algebra Lecture 08 9/26/4. Cardinality I started talking about cardinality last time, and you did some stuff with it in the Homework, so let s continue. I said that two sets have the same

More information

6c Lecture 14: May 14, 2014

6c Lecture 14: May 14, 2014 6c Lecture 14: May 14, 2014 11 Compactness We begin with a consequence of the completeness theorem. Suppose T is a theory. Recall that T is satisfiable if there is a model M T of T. Recall that T is consistent

More information

Math 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011

Math 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011 Math 31 Lesson Plan Day 2: Sets; Binary Operations Elizabeth Gillaspy September 23, 2011 Supplies needed: 30 worksheets. Scratch paper? Sign in sheet Goals for myself: Tell them what you re going to tell

More information

Final Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2

Final Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2 Final Review Sheet The final will cover Sections Chapters 1,2,3 and 4, as well as sections 5.1-5.4, 6.1-6.2 and 7.1-7.3 from chapters 5,6 and 7. This is essentially all material covered this term. Watch

More information

The roots of computability theory. September 5, 2016

The roots of computability theory. September 5, 2016 The roots of computability theory September 5, 2016 Algorithms An algorithm for a task or problem is a procedure that, if followed step by step and without any ingenuity, leads to the desired result/solution.

More information

MATH 341, Section 001 FALL 2014 Introduction to the Language and Practice of Mathematics

MATH 341, Section 001 FALL 2014 Introduction to the Language and Practice of Mathematics MATH 341, Section 001 FALL 2014 Introduction to the Language and Practice of Mathematics Class Meetings: MW 9:30-10:45 am in EMS E424A, September 3 to December 10 [Thanksgiving break November 26 30; final

More information

Mathematical Logic Part One

Mathematical Logic Part One Mathematical Logic Part One Question: How do we formalize the defnitions and reasoning we use in our proofs? Where We're Going Propositional Logic (Today) Basic logical connectives. Truth tables. Logical

More information

Math 31 Lesson Plan. Day 5: Intro to Groups. Elizabeth Gillaspy. September 28, 2011

Math 31 Lesson Plan. Day 5: Intro to Groups. Elizabeth Gillaspy. September 28, 2011 Math 31 Lesson Plan Day 5: Intro to Groups Elizabeth Gillaspy September 28, 2011 Supplies needed: Sign in sheet Goals for students: Students will: Improve the clarity of their proof-writing. Gain confidence

More information

Class 29 - November 3 Semantics for Predicate Logic

Class 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 information

Lecture 4: Constructing the Integers, Rationals and Reals

Lecture 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 information