Hilbert’s Progamme Early in C20, the mathematician Hilbert led a programme to formalise maths; to reduce it to a clear set of axioms and show that all.

Slides:



Advertisements
Similar presentations
AE1APS Algorithmic Problem Solving John Drake. The island of Knights and Knaves is a fictional island to test peoples ability to reason logically. There.
Advertisements

Anselm On the Existence of God. “Nor do I seek to understand so that I can believe, but rather I believe so that I can understand. For I believe this.
Introduction to Proofs
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Solving Word Problems II
The Island of Knights and Knaves. Knights always tell the truth.
Some Puzzles About Truth (and belief, knowledge, opinion, and lying)
Induction and recursion
Math 333 – Euclidean and Non-Euclidean Geometry Dr. Hamblin.
CS1001 Lecture 22. Overview Mechanizing Reasoning Mechanizing Reasoning G ö del ’ s Incompleteness Theorem G ö del ’ s Incompleteness Theorem.
Logic and Proof. Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement.
So far we have learned about:
Logic Puzzles Miran Kim Ben Seelbinder Matthew Sgambati.
First Order Logic (chapter 2 of the book) Lecture 3: Sep 14.
Lecture 24: Gödel’s Proof CS150: Computer Science
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
Computability Thank you for staying close to me!! Learning and thinking More algorithms... computability.
2-5 Postulates Ms. Andrejko.
Introduction to Computer Science. A Quick Puzzle Well-Formed Formula  any formula that is structurally correct  may be meaningless Axiom  A statement.
Mathematics and the Theory of Knowledge
Logical Puzzles Truth and Lies. The Island of Rilas On the island of Rilas there are just two types of people: knights and knaves Knights always tell.
First Order Logic. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about first order.
Class 36: Proofs about Unprovability David Evans University of Virginia cs1120.
Postulates and Paragraph Proofs
Lecture 5 Knights and Knaves.. Administration Show hand in form. Show plagiarism form. Any problems with coursework? Google knight and knaves and look.
Copyright © Curt Hill Using Propositional Logic Several applications.
David Evans CS200: Computer Science University of Virginia Computer Science Class 24: Gödel’s Theorem.
College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson.
Copyright © Cengage Learning. All rights reserved. CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF ELEMENTARY NUMBER THEORY AND METHODS OF PROOF.
MAT 333 Fall  As we discovered with the Pythagorean Theorem examples, we need a system of geometry to convince ourselves why theorems are true.
2012: J Paul GibsonTSP: MSC SAI Mathematical FoundationsMAT7003.ProofsWithRodin.1 MAT 7003 : Mathematical Foundations (for Software Engineering) J Paul.
Institute for Experimental Physics University of Vienna Institute for Quantum Optics and Quantum Information Austrian Academy of Sciences Undecidability.
Course Overview and Road Map Computability and Logic.
1.1 Introduction to Inductive and Deductive Reasoning
Inductive/Dedu ctive Reasoning Using reasoning in math and science.
TOK: Mathematics Unit 1 Day 1. Introduction Opening Question Is math discovered or is it invented? Think about it. Think real hard. Then discuss.
Activity 1-19: The Propositional Calculus
Logical Reasoning:Proof Prove the theorem using the basic axioms of algebra.
Godel’s proof Danny Brown. Outline of godel’s proof 1.Create a statement that says of itself that it is not provable 2.Show that this statement is provable.
Thinking in Methodologies Class Notes. Gödel’s Theorem.
Week 4 - Monday.  What did we talk about last time?  Divisibility  Quotient-remainder theorem  Proof by cases.
Friday 8 Sept 2006Math 3621 Axiomatic Systems Also called Axiom Systems.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
Copyright © Curt Hill Proofs An Introduction.
Incompleteness. System Relativity Soundness and completeness are properties of particular logical systems. There’s no sense to be made of the claim that.
Computation Motivating questions: What does “computation” mean? What are the similarities and differences between computation in computers and in natural.
1.1 The Structure of Geometry: Definition, Postulate, Theorem Wherein we meet for the first time three fundamental notions - definition, postulate and.
Copyright © Cengage Learning. All rights reserved. Sequences and Series.
Is God real? An argument based on Government and direction There are many objects in the world (natural objects) which have no way of knowing what their.
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
Conjectures/Justification Session 5. Outcomes for Conjectures/Justifications When you want the students to take informal knowledge and make it formal.
Mathematical Proof A domino and chessboard problem.
Activity 1-12 : Multiple-free sets
Proofs.
TOK: Mathematics Unit 1 Day 1. 2 – B 2 = AB – B 2 Factorize both sides: (A+B)(A-B) = B(A-B) Divide both sides by (A-B): A = B = B Since A = B, B+B=B Add.
Axioms and Theorems. Remember syllogisms? The Socrates Syllogism All human beings are mortal Socrates is a human being Therefore Socrates is mortal premises.
Chapter 1 Logic and Proof.
Axiomatic Number Theory and Gödel’s Incompleteness Theorems
Lecture 22: Gödel’s Theorem CS200: Computer Science
Interpreting and analysing data
CS 220: Discrete Structures and their Applications
Copyright © Cengage Learning. All rights reserved.
Using Inductive Reasoning
Class 24: Computability Halting Problems Hockey Team Logo
Knights and Knaves.
1.1 Introduction to Inductive and Deductive Reasoning
Interpreting and analysing data
Philosophy of Mathematics: a sneak peek
An example of the “axiomatic approach” from geometry
Logical and Rule-Based Reasoning Part I
Presentation transcript:

Hilbert’s Progamme Early in C20, the mathematician Hilbert led a programme to formalise maths; to reduce it to a clear set of axioms and show that all true mathematical statements can be proved. It seemed like a natural idea, and the right way to use an axiomatic system.

Puzzle Think of a number. If it is even, half it. If it is odd, multiply by three and add one. Keep doing this. What do you find?

Puzzle Mathematicians have tested billions of cases, and the series always ends up at one, but no-one has yet proved it. Some people believe that the conjecture that ‘the series always ends at 1’ is true, but unproveable (not just that we haven’t done it yet, but that it is in principle not possible to prove it).

Puzzle Mathematicians have tested billions of cases, and the series always ends up at one, but no-one has yet proved it. Some people believe that the conjecture that ‘the series always ends at 1’ is true, but unprovable (not just that we haven’t done it yet, but that it is in principle not possible to prove it). What? Surely the whole point of Maths is to know that theorems are true by proving them!

Prize Competition I have 2 prizes (A and B) and it’s very simple to win one. If you make a false statement then you get no prize If you make a true statement then you get one of the prizes, but you don’t know which one. What should you say if you want to win prize A?

Prize Competition Statement: I will not get prize B TrueFalse Not only is the statement true, it ‘makes itself true’  False statement  no prize True statement  one prize (A or B but you don’t know which) You want prize A

The Island of Knights and Knaves A certain Island is populated only by Knights and Knaves who look the same, but All knights tell the truth all the time All knaves lie all the time All Knights are all members of either club A or club B but not both. Knaves are banned from both clubs.

The Island of Knights and Knaves You meet someone on a path and she says something. You do not know if she is a knave or a knight, but from what she says you can deduce that she is in club A. What did she say?

Knights and Knaves Statement: I am not in club B KnightKnave  Knaves  always lie and cannot be in either club Knights  always tell truth and are in one club You meet someone; she says something and you deduce she is in club A

The Island of Provable and Unprovable Statements An Island is populated by mathematical statements. Some statements are true (knights) Some statements are false (knaves) You cannot easily tell the difference. We are only interested in the true ones here. All true statements (knights) are provable (club A) or unprovable (club B) but not both.

The Island of Provable and Unprovable Statements Provable Unprovable TrueFalse eg Pythagoras’ theorem ? ? Godel showed that there are statements which cannot be proven either true or false. The example we did at the start may be one such example eg even + even = odd eg ? eg ?

I am not provable TrueFalse The Island of Provable and Unprovable statements Not only is the statement not false, the statement ‘makes itself’ impossible to be false Not only is the statement true, it ‘makes itself true’  This is the ‘translation’ of the mathematical theorem into English

Kurt Godel proved that there are mathematical equivalents of the statement “I am not provable”, which by their very nature must be true. So there are mathematical theorems which are true but for which no proof exists (n.b. not that we just haven’t yet found them; they really are unprovable). The World of Mathematical Theorems

Hilbert’s Progamme So (for this reason and others) Hilbert’s programme was shown to be impossible. This was a great surprise and shows that the notion of truth in maths is a stronger one that that of proof. Whereas it was once thought they were very closely linked we now realise that there is no necessary link. Where does this leave the notion of absolute truth in Maths?