Gödel s Theorem: An Incomplete Guide to Its Use and Abuse

Save this PDF as:

Size: px
Start display at page:

Download "Gödel s Theorem: An Incomplete Guide to Its Use and Abuse"

Transcription

1 Gödel s Theorem: An Incomplete Guide to Its Use and Abuse by Torkel Franzén Summary by Xavier Noria August 2006

2 This unique exposition of Kurt Gödel s stunning incompleteness theorems for a general audience manages to do what no other has accomplished: explain clearly and thoroughly just what the theorems really say and imply and correct their diverse misapplications to philosophy, psychology, physics, theology, post-modernist criticism and what have you. Solomon Feferman

3 Introduction

4 Gödel s incompleteness theorem is probably the one that has arose more interest among nonmathematicians, it was published in 1931 by Gödel, and strengthened in 1936 by Rosser That s a result of logic about the consistency and completeness of formal systems, those terms have a precise technical meaning and so care is needed when interpreting the theorem outside logic

5 The implications of this theorem are often overstated, for example: turned not only mathematics, but also the whole world of science on its head Gödel s incompleteness theorem brought no revolution whatsoever to mathematics, in general it plays no role in the work of working mathematicians However, the theorem raises a number of philosophical questions concerning the nature of logic and mathematics

6 The First Incompleteness Theorem

7 Terminology Given a formal language L, a formal system S in L is a set of axioms and syntactical rules of reasoning (also called inference rules) expressed in L. A theorem of S is any statement T of S which is obtainable by a series of applications of the inference rules of S starting from the axioms of S, such a sequence is called a proof of T in S Those concepts are purely symbolic, nothing is said about any meaning or soundness

8 A formal system S is said to be consistent if it has no sentence A such that A and A are both theorems of S A sentence A of S is said to be undecidable in S if neither A nor A are theorems of S A formal system is said to be complete if it has no undecidable sentences, otherwise it is incomplete If A is a sentence of S, we denote by S+A the formal system obtained by adding A as a new axiom to the ones of S, and with the same rules

9 Observations By ex falso quodlibet an inconsistent theory has no undecidable statements, everything is a theorem A is probable in S iff S+ A is inconsistent A is undecidable in S iff both S+A and S+ A are consistent

10 First Incompleteness Theorem First incompleteness theorem (Gödel- Rosser). Any consistent formal system S within which a certain amount of elementary arithmetic can be carried out is incomplete with regard to statements of elementary arithmetic

11 Goldbach-like Statements Goldbach s conjecture states that every even number greater than 2 is the sum of two primes, it is unknown whether it holds For any given even number greater than 2 we can check that property applying an algorithm, that s a computable property We call Goldbach-like those statements of the form Every natural number has property P, where P is a computable property

12 Goldbach-like statements have an important characteristic, if they are false they are disprovable because there s an algorithm that finds a counterexample However, we do not know in advance which mathematical methods will give a proof of a true Goldbach-like statement, in case there is one

13 The Twin Prime Conjecture The Twin Prime conjecture states there are infinitely many primes p such that p+2 is also prime, it is unknown whether it holds That is not a Goldbach-like statement: given a natural n the procedure that systematically looks for pairs p, p+2 with n p will not terminate if there s none

14 An Important Property If a Goldbach-like sentence in a consistent system S incorporating some basic arithmetic is provable or undecidable in S then it is necessarily true, for if it was false a proof of its negation would exist, and so S wouldn t be consistent In the traditional proof of the incompleteness theorem a Goldbach-like and undecidable sentence is shown

15 Hilbert s non ignorabimus Gödel s Incompleteness theorem does not refute Hilbert s view that mathematicians can find solutions to any mathematical problem by means of pure reason Instead, it establishes that Hilbert s optimism cannot be justified by exhibiting any single formal system within which all mathematical problems are solvable

16 Unprovable Truths It is often said that Gödel demonstrated that there a truths that cannot be proved. This is incorrect, provability is always relative to a formal system If an arithmetic sentence was undecidable in ZFC we still could select a stronger set of axioms valid as foundations and try to prove it there That is not to say that such a switch would be without controversy

17 Complete Formal Systems The incompleteness theorem does not imply that every consistent formal system is incomplete The theory of the real numbers is complete, and it comprises the arithmetic of real numbers Although the natural numbers are a subset of the real numbers they are not definable within the theory of real numbers, and so the premise of the incompleteness theorem do not hold

18 Applicability The incompleteness theorem guarantees the existence of undecidable arithmetical statements in certain kinds of formal systems It says nothing about the existence of undecidable non-arithmetical or non-mathematical statements The incompleteness theorem does not apply in contexts where there s no formal system like, say, the Bible, or the Constitution, analogies and metaphors rarely suffice

19 Mind vs. Computer Some people speculate that the incompleteness theorem implies the mind surpasses the machine because it can see the truth of formulas the machine won t be able to demonstrate This argument is invalid, in general we have no idea about whether the Gödel sentence of a system is true, what we know is that it is true iff the system is consistent, and this much is provable in the system itself

20 Incompleteness and the TOE Some people question the feasibility of a Theory of Everything in physics because of the theorem A TOE would probably be a formal system where Gödel s theorem applies, and in such case the theorem tells us there would be an incompleteness in its arithmetical component, but whether or not the basic equations of physics are complete considered as a description of the physical world, and what completeness might mean in such a case, is not something that the incompleteness theorem tells us anything about

21 Truth Truth is not a mathematical concept, and so it is normally avoided by mathematicians, a proof in logic is a syntactic derivation and has nothing to do with the truth or falsehood of a sentence When a mathematician says that the twin prime conjecture may be true he means that there may be infinitely many primes p such that p+2 is also prime, no more no less

22 ZFC There s nothing that supports in that arithmetical statements like the twin prime conjecture could be actually undecidable in ZFC, in practice there s no need to feel at all worried by the possibility of natural mathematical problem being unsolvable Some problems in Set Theory are known to be unsolvable in ZFC, like Cantor s continuum hypothesis

23 Some Later Developments There has been considerable work seeking undecidable statements close to ordinary mathematics In arithmetic the first result of this kind was the Paris-Harrington theorem (1976) which establishes the unprovability of a combinatorial statement Gödel himself suggested a way to extend the arithmetical component of ZFC with axioms of infinity that imply some undecidable statements

24 Another line of development followed by Gregory Chaitin in the 1960s relates incompleteness to Kolmogorov complexity

25 The Second Incompleteness Theorem

26 Second Incompleteness Theorem Second incompleteness theorem (Gödel). For any consistent formal system S within which a certain amount of elementary arithmetic can be carried out, the consistency of S cannot be proved in S itself

27 Observations The certain amount of arithmetic in the second theorem is not the same we ask for in the first one S is consistent can be expressed in said systems thanks to a technique called arithmetization of syntax that uses a way of representing syntactical objects such as sentences and proofs as numbers called Gödel numbering

28 The consistency of such systems is sometimes proved in other systems, for instance Gentzen showed that PA is consistent using a theory T that extends PA, but that yields an infinite regress since we need now to investigate the consistency of T

29 Doubts Some people think the second incompleteness theorem raises doubts about the consistency of formal systems used in mathematics, we can t prove it in an absolute manner, so there s a logical possibility of mathematics being inconsistent From a metamathematical view, though, it would be of little use to prove the consistency of ZFC within ZFC, for if we doubt about its consistency in the first place how can we trust the theorem?

30 In fact, if ZFC was inconsistent it would indeed proof its consistency, since every sentence is a theorem in an inconsistent system, so even if ZFC could prove its own consistency little would follow as far as our confidence in the system go The second incompleteness is mainly of interest to logicians, whose object of study are logics, the same way an algebraist studies, say, rings and is interested in their properties

31 So, Are Mathematics At Risk? No one doubts of the consistency of the axioms on which ordinary mathematics are based, and therefore of the validity of the theorems such as that there are infinitely many primes That belief comes from consensus, common sense, experience, tradition, etc., not from logic

32 Hilbert s Program It is often said that the second incompleteness theorem demolished Hilbert s program, whose goal was to prove the consistency of mathematics by finitistic reasoning This was not the view of Gödel himself. Rather, the theorem showed that the means by which acceptable consistency proofs could be carried out had to be extended and Gödel gave one way in his Dialectica interpretation, published in 1958

33 Computability, Formal Systems and Incompleteness

34 Alternative Proofs Over time logicians have developed techniques to demonstrate both incompleteness theorems using other approaches than the original proofs

35 Strings By a string is meant any finite sequence of symbols The length of a string is defined to be the number of occurrences of its symbols For instance numerals in decimal positional notation are strings of the alphabet of digits

36 Computably Enumerable Sets Numerals can be generated in lexicographic order by a computer program, such a set of strings is called computably enumerable In that definition we allow repetitions, and if the set is finite we allow the program not to halt, as long as it eventually exhausts the set of strings Turing machines or some other model of computation are used to formalize these concepts, but we informal descriptions will do for us

37 Computably Decidable Sets There is an algorithm that decides whether a given string will ever appear in the enumeration of numerals mentioned in the previous slide 13 does, 007 does not, neither does foo by definition this property makes the set of numerals computable, or computably decidable, or just decidable A set that is not decidable is said to be (computably) undecidable

38 We ve Got Two Decidable s We have by now a definition of decidable that applies to sentences of formal systems, an another one that applies to sets of strings They are different, but there s a connection between them that we will see in this section

39 Enumerability & Decidability Every computably decidable set is computably enumerable A set E is computably decidable iff both E and its complement are computably enumerable Undecidability theorem (Turing, Church). There are computably enumerable sets which are not computably decidable

40 Formal Systems and Decidability The set of sentences of the language of a formal system is assumed to be a decidable set of strings Axioms and inference rules need to be defined in such a way that the set of theorems is computably enumerable If the set of theorems is indeed decidable the formal system is said to be decidable

41 A complete formal system is always decidable, for either it is inconsistent, or else we determine if a sentence A is a theorem enumerating its theorems until either A or A is found There are also theories which are decidable and incomplete

42 Computability & Incompleteness There is a proof of the incompleteness theorem that does not use any arithmetical formalization of self-referential sentences (so they are not essential) It is based on computability theory and uses the Matiyasevich-Robinson-Davis-Putman theorem The proof shows that there are infinitely many equations D(x1,..., xn) = 0 for which is undecidable in S whether or not they have solution

43 The Completeness Theorem

44 The Completeness Theorem Gödel himself proved that first-order theories are complete, in that theorem complete has another meaning though A model of a first-order system is a mathematical structure that satisfies its axioms given a certain interpretation Given a first-order system S, the completeness theorem establishes that a sentence of S is a theorem of S iff it holds in all models of S

45 Nonstandard Models Sometimes it is said that the first incompleteness theorem implies that in any theory T of a certain degree of complexity there are sentences that are true in all models of T yet undecidable in T The first incompleteness theorem neither states nor implies such a thing, on the contrary, the completeness theorem implies that if a sentence is true in all models of a first-order theory T (such as PA or ZFC) then it is decidable in T, for it is indeed a theorem of T

6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008

MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

CHAPTER 7 GENERAL PROOF SYSTEMS

CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes

CS 3719 (Theory of Computation and Algorithms) Lecture 4

CS 3719 (Theory of Computation and Algorithms) Lecture 4 Antonina Kolokolova January 18, 2012 1 Undecidable languages 1.1 Church-Turing thesis Let s recap how it all started. In 1990, Hilbert stated a

Consistency, completeness of undecidable preposition of Principia Mathematica. Tanmay Jaipurkar

Consistency, completeness of undecidable preposition of Principia Mathematica Tanmay Jaipurkar October 21, 2013 Abstract The fallowing paper discusses the inconsistency and undecidable preposition of Principia

13 Infinite Sets. 13.1 Injections, Surjections, and Bijections. mcs-ftl 2010/9/8 0:40 page 379 #385

mcs-ftl 2010/9/8 0:40 page 379 #385 13 Infinite Sets So you might be wondering how much is there to say about an infinite set other than, well, it has an infinite number of elements. Of course, an infinite

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture No. # 31 Recursive Sets, Recursively Innumerable Sets, Encoding

Turing Machines: An Introduction

CIT 596 Theory of Computation 1 We have seen several abstract models of computing devices: Deterministic Finite Automata, Nondeterministic Finite Automata, Nondeterministic Finite Automata with ɛ-transitions,

Gödel s First Incompleteness Theorem. The following result is a cornerstone of modern logic:

Gödel s First Incompleteness Theorem The following result is a cornerstone of modern logic: Self-referential Lemma. For any formula R(x), there is a sentence N such that (N : R([ + N, ])) is a consequence

Introduction to Proofs

Chapter 1 Introduction to Proofs 1.1 Preview of Proof This section previews many of the key ideas of proof and cites [in brackets] the sections where they are discussed thoroughly. All of these ideas are

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce

8 Primes and Modular Arithmetic

8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.

Handout #1: Mathematical Reasoning

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008

MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

This chapter is all about cardinality of sets. At first this looks like a

CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

Mathematical Induction

Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

Alan Turing and the Unsolvable Problem To Halt or Not to Halt That Is the Question

Alan Turing and the Unsolvable Problem To Halt or Not to Halt That Is the Question Cristian S. Calude 26 April 2012 Alan Turing Alan Mathison Turing was born in a nursing home in Paddington, London, now

Georg Cantor (1845-1918):

Georg Cantor (845-98): The man who tamed infinity lecture by Eric Schechter Associate Professor of Mathematics Vanderbilt University http://www.math.vanderbilt.edu/ schectex/ In papers of 873 and 874,

Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

Theory of Computation Lecture Notes

Theory of Computation Lecture Notes Abhijat Vichare August 2005 Contents 1 Introduction 2 What is Computation? 3 The λ Calculus 3.1 Conversions: 3.2 The calculus in use 3.3 Few Important Theorems 3.4 Worked

2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.

2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then

(LMCS, p. 317) V.1. First Order Logic. This is the most powerful, most expressive logic that we will examine.

(LMCS, p. 317) V.1 First Order Logic This is the most powerful, most expressive logic that we will examine. Our version of first-order logic will use the following symbols: variables connectives (,,,,

Proof of Infinite Number of Fibonacci Primes. Stephen Marshall. 22 May Abstract

Proof of Infinite Number of Fibonacci Primes Stephen Marshall 22 May 2014 Abstract This paper presents a complete and exhaustive proof of that an infinite number of Fibonacci Primes exist. The approach

Theory of Automated Reasoning An Introduction. Antti-Juhani Kaijanaho

Theory of Automated Reasoning An Introduction Antti-Juhani Kaijanaho Intended as compulsory reading for the Spring 2004 course on Automated Reasononing at Department of Mathematical Information Technology,

How many numbers there are?

How many numbers there are? RADEK HONZIK Radek Honzik: Charles University, Department of Logic, Celetná 20, Praha 1, 116 42, Czech Republic radek.honzik@ff.cuni.cz Contents 1 What are numbers 2 1.1 Natural

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

MATHEMATICS: CONCEPTS, AND FOUNDATIONS Vol. III - Logic and Computer Science - Phokion G. Kolaitis

LOGIC AND COMPUTER SCIENCE Phokion G. Kolaitis Computer Science Department, University of California, Santa Cruz, CA 95064, USA Keywords: algorithm, Armstrong s axioms, complete problem, complexity class,

Computability Theory

CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Computability Theory This section is partly inspired by the material in A Course in Mathematical Logic by Bell and Machover, Chap 6, sections 1-10.

Applications of Methods of Proof

CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The set-theoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are

arxiv:0804.4490v1 [math.gm] 28 Apr 2008

Infinite sequences in the framework of classical logic arxiv:0804.4490v1 [math.gm] 28 Apr 2008 V.V. Ivanov N.N. Semenov Institute of Chemical Physics, Russian Academy of Sciences, Kosygin str.4, Moscow,

This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.

3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but

SECTION 10-2 Mathematical Induction

73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

Set Theory Basic Concepts and Definitions

Set Theory Basic Concepts and Definitions The Importance of Set Theory One striking feature of humans is their inherent need and ability to group objects according to specific criteria. Our prehistoric

There is no degree invariant half-jump

There is no degree invariant half-jump Rod Downey Mathematics Department Victoria University of Wellington P O Box 600 Wellington New Zealand Richard A. Shore Mathematics Department Cornell University

P (A) = lim P (A) = N(A)/N,

1.1 Probability, Relative Frequency and Classical Definition. Probability is the study of random or non-deterministic experiments. Suppose an experiment can be repeated any number of times, so that we

Hilberts Entscheidungsproblem, the 10th Problem and Turing Machines

Hilberts Entscheidungsproblem, the 10th Problem and Turing Machines Nitin Saxena (Hausdorff Center for Mathematics, Bonn) [Happy] [100 th ] [Alan] [Mathison] [Turing!][][][]... **all pictures are works

Theorem3.1.1 Thedivisionalgorithm;theorem2.2.1insection2.2 If m, n Z and n is a positive

Chapter 3 Number Theory 159 3.1 Prime Numbers Prime numbers serve as the basic building blocs in the multiplicative structure of the integers. As you may recall, an integer n greater than one is prime

def: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.

Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true

ON FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS

PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Mathematical Sciences 2012 1 p. 43 48 ON FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS I nf or m at i cs L. A. HAYKAZYAN * Chair of Programming and Information

Computational Models Lecture 8, Spring 2009

Slides modified by Benny Chor, based on original slides by Maurice Herlihy, Brown Univ. p. 1 Computational Models Lecture 8, Spring 2009 Encoding of TMs Universal Turing Machines The Halting/Acceptance

WRITING PROOFS. Christopher Heil Georgia Institute of Technology

WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this

Chapter 11 Number Theory

Chapter 11 Number Theory Number theory is one of the oldest branches of mathematics. For many years people who studied number theory delighted in its pure nature because there were few practical applications

Chapter 7 Uncomputability

Chapter 7 Uncomputability 190 7.1 Introduction Undecidability of concrete problems. First undecidable problem obtained by diagonalisation. Other undecidable problems obtained by means of the reduction

Introduction to Theory of Computation

Introduction to Theory of Computation Prof. (Dr.) K.R. Chowdhary Email: kr.chowdhary@iitj.ac.in Formerly at department of Computer Science and Engineering MBM Engineering College, Jodhpur Tuesday 28 th

Introduction to Automata Theory. Reading: Chapter 1

Introduction to Automata Theory Reading: Chapter 1 1 What is Automata Theory? Study of abstract computing devices, or machines Automaton = an abstract computing device Note: A device need not even be a

A Few Basics of Probability

A Few Basics of Probability Philosophy 57 Spring, 2004 1 Introduction This handout distinguishes between inductive and deductive logic, and then introduces probability, a concept essential to the study

Chapter 1 Verificationism Then and Now

Chapter 1 Verificationism Then and Now Per Martin-Löf The term veri fi cationism is used in two different ways: the fi rst is in relation to the veri fi cation principle of meaning, which we usually and

3515ICT Theory of Computation Turing Machines

Griffith University 3515ICT Theory of Computation Turing Machines (Based loosely on slides by Harald Søndergaard of The University of Melbourne) 9-0 Overview Turing machines: a general model of computation

Absolute Value of Reasoning

About Illustrations: Illustrations of the Standards for Mathematical Practice (SMP) consist of several pieces, including a mathematics task, student dialogue, mathematical overview, teacher reflection

Sections 2.1, 2.2 and 2.4

SETS Sections 2.1, 2.2 and 2.4 Chapter Summary Sets The Language of Sets Set Operations Set Identities Introduction Sets are one of the basic building blocks for the types of objects considered in discrete

Open and Closed Sets

Open and Closed Sets Definition: A subset S of a metric space (X, d) is open if it contains an open ball about each of its points i.e., if x S : ɛ > 0 : B(x, ɛ) S. (1) Theorem: (O1) and X are open sets.

CSE 135: Introduction to Theory of Computation Decidability and Recognizability

CSE 135: Introduction to Theory of Computation Decidability and Recognizability Sungjin Im University of California, Merced 04-28, 30-2014 High-Level Descriptions of Computation Instead of giving a Turing

Grade 7/8 Math Circles Sequences and Series

Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Sequences and Series November 30, 2012 What are sequences? A sequence is an ordered

Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 1, due Wedneday, January 25 1.1.10 Let p and q be the propositions The election is decided and The votes have been counted, respectively.

Semantics for the Predicate Calculus: Part I

Semantics for the Predicate Calculus: Part I (Version 0.3, revised 6:15pm, April 14, 2005. Please report typos to hhalvors@princeton.edu.) The study of formal logic is based on the fact that the validity

2.1 The Algebra of Sets

Chapter 2 Abstract Algebra 83 part of abstract algebra, sets are fundamental to all areas of mathematics and we need to establish a precise language for sets. We also explore operations on sets and relations

3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

1/10. Descartes 2: The Cogito and the Mind

1/10 Descartes 2: The Cogito and the Mind Recap: last week we undertook to follow Descartes path of radical doubt in order to attempt to discover what, if anything, can be known for certain. This path

What we still don t know about addition and multiplication Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA (University of Georgia, emeritus) Bay Area Mathematical Adventures Santa Clara University

Invalidity in Predicate Logic

Invalidity in Predicate Logic So far we ve got a method for establishing that a predicate logic argument is valid: do a derivation. But we ve got no method for establishing invalidity. In propositional

The Foundations: Logic and Proofs. Chapter 1, Part III: Proofs

The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Rules of Inference Section 1.6 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments

5544 = 2 2772 = 2 2 1386 = 2 2 2 693. Now we have to find a divisor of 693. We can try 3, and 693 = 3 231,and we keep dividing by 3 to get: 1

MATH 13150: Freshman Seminar Unit 8 1. Prime numbers 1.1. Primes. A number bigger than 1 is called prime if its only divisors are 1 and itself. For example, 3 is prime because the only numbers dividing

Section 6-2 Mathematical Induction

6- Mathematical Induction 457 In calculus, it can be shown that e x k0 x k k! x x x3!! 3!... xn n! where the larger n is, the better the approximation. Problems 6 and 6 refer to this series. Note that

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called

Hypercomputation: computing more than the Turing machine

Hypercomputation: computing more than the Turing machine Abstract: Toby Ord Department of Philosophy * The University of Melbourne t.ord@pgrad.unimelb.edu.au In this report I provide an introduction to

EQUATIONAL LOGIC AND ABSTRACT ALGEBRA * ABSTRACT

EQUATIONAL LOGIC AND ABSTRACT ALGEBRA * Taje I. Ramsamujh Florida International University Mathematics Department ABSTRACT Equational logic is a formalization of the deductive methods encountered in studying

Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.

Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole

Clicker Question. Theorems/Proofs and Computational Problems/Algorithms MC215: MATHEMATICAL REASONING AND DISCRETE STRUCTURES

MC215: MATHEMATICAL REASONING AND DISCRETE STRUCTURES Tuesday, 1/21/14 General course Information Sets Reading: [J] 1.1 Optional: [H] 1.1-1.7 Exercises: Do before next class; not to hand in [J] pp. 12-14:

Formal Tools and the Philosophy of Mathematics

9 Formal Tools and the Philosophy of Mathematics Thomas Hofweber 1 How can we do better? In this chapter, I won t try to defend a particular philosophical view about mathematics, but, in the spirit of

CS_226 Computability Theory

Examples CS_226 Computability Theory http://www.cs.swan.ac.uk/ csetzer/lectures/computability/ 08/index.html Course Notes, Michaelmas Term 2008 Anton Setzer (Dept. of Computer Science, Swansea) http://www.cs.swan.ac.uk/

Predicate Calculus. There are certain arguments that seem to be perfectly logical, yet they cannot be expressed by using propositional calculus.

Predicate Calculus (Alternative names: predicate logic, first order logic, elementary logic, restricted predicate calculus, restricted functional calculus, relational calculus, theory of quantification,

Set theory as a foundation for mathematics

V I I I : Set theory as a foundation for mathematics This material is basically supplementary, and it was not covered in the course. In the first section we discuss the basic axioms of set theory and the

Introduction. Appendix D Mathematical Induction D1

Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to

6.080/6.089 GITCS Feb 12, 2008. Lecture 3

6.8/6.89 GITCS Feb 2, 28 Lecturer: Scott Aaronson Lecture 3 Scribe: Adam Rogal Administrivia. Scribe notes The purpose of scribe notes is to transcribe our lectures. Although I have formal notes of my

THE TURING DEGREES AND THEIR LACK OF LINEAR ORDER

THE TURING DEGREES AND THEIR LACK OF LINEAR ORDER JASPER DEANTONIO Abstract. This paper is a study of the Turing Degrees, which are levels of incomputability naturally arising from sets of natural numbers.

1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form

1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and

This puzzle is based on the following anecdote concerning a Hungarian sociologist and his observations of circles of friends among children.

0.1 Friend Trends This puzzle is based on the following anecdote concerning a Hungarian sociologist and his observations of circles of friends among children. In the 1950s, a Hungarian sociologist S. Szalai

Finite Automata and Formal Languages

Finite Automata and Formal Languages TMV026/DIT321 LP4 2011 Lecture 14 May 19th 2011 Overview of today s lecture: Turing Machines Push-down Automata Overview of the Course Undecidable and Intractable Problems

Pythagorean Triples. Chapter 2. a 2 + b 2 = c 2

Chapter Pythagorean Triples The Pythagorean Theorem, that beloved formula of all high school geometry students, says that the sum of the squares of the sides of a right triangle equals the square of the

On Formally Undecidable Propositions of Principia Mathematica And Related Systems

On Formally Undecidable Propositions of Principia Mathematica And Related Systems KURT GÖDEL Translated by B. MELTZER Introduction by R. B. BRAITHWAITE TO CHRISTOPHER FERNAU in gratitude FL: Page 1 11/10/00

Induction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition

Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing

An example of a computable

An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept

We now explore a third method of proof: proof by contradiction.

CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement

NP-Completeness and Cook s Theorem

NP-Completeness and Cook s Theorem Lecture notes for COM3412 Logic and Computation 15th January 2002 1 NP decision problems The decision problem D L for a formal language L Σ is the computational task:

6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008

MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

CANTOR S DIAGONAL ARGUMENT: PROOF AND PARADOX

CANTOR S DIAGONAL ARGUMENT: PROOF AND PARADOX Cantor s diagonal method is elegant, powerful, and simple. It has been the source of fundamental and fruitful theorems as well as devastating, and ultimately,

11 Ideals. 11.1 Revisiting Z

11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

Foundations of mathematics

Foundations of mathematics 1. First foundations of mathematics 1.1. Introduction to the foundations of mathematics Mathematics, theories and foundations Sylvain Poirier http://settheory.net/ Mathematics

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

Chapter 3: The basic concepts of probability

Chapter 3: The basic concepts of probability Experiment: a measurement process that produces quantifiable results (e.g. throwing two dice, dealing cards, at poker, measuring heights of people, recording

Super Turing-Machines

1 This preprint differs from the published version. Do not quote or photocopy. Super Turing-Machines B. Jack Copeland 2 1. Universal Turing Machines A universal Turing machine is an idealised computing

Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

Regular Languages and Finite Automata

Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a

[Refer Slide Time: 05:10]

Principles of Programming Languages Prof: S. Arun Kumar Department of Computer Science and Engineering Indian Institute of Technology Delhi Lecture no 7 Lecture Title: Syntactic Classes Welcome to lecture