STRUCTURAL PROOF THEORY: Uncovering capacities of the mathematical mind Wilfried Sieg Carnegie Mellon.

Slides:



Advertisements
Similar presentations
Meditation IV God is not a Deceiver, Truth Criterion & Problem of Error.
Advertisements

P.M van Hiele Mathematics Learning Theorist Rebecca Bonk Math 610 Fall 2009.
Discrete Math Methods of proof 1.
color code vocabulary words and definitions
The Cogito. The Story So Far! Descartes’ search for certainty has him using extreme sceptical arguments in order to finally arrive at knowledge. He has.
CHAPTER 13 Inference Techniques. Reasoning in Artificial Intelligence n Knowledge must be processed (reasoned with) n Computer program accesses knowledge.
Copyright © Cengage Learning. All rights reserved.
Saramma Mathew. Scientific temper describes an attitude which involves the application of logic and the avoidance of bias and preconceived notions.
Chapter 1 What is Science
CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 7: Beyond Classical Logic.
Week 7 - Wednesday.  What did we talk about last time?  Set proofs and disproofs  Russell’s paradox.
HISTORY OF LOGIC BY JOHN NAGUIB. What is Logic? The science or study of how to evaluate arguments and reasoning. “Logic is new and necessary reasoning”
Meditation One What is the objective of the Meditations? Hint: look at second sentence of Med. I.
Prepared By Jacques E. ZOO Bohm’s Philosophy of Nature David Bohm, Causality and Chance in Modern Physics (New York, 1957). From Feyerabend, P. K.
Logic and Set Theory.
So far we have learned about:
Copyright © Cengage Learning. All rights reserved.
Computability Thank you for staying close to me!! Learning and thinking More algorithms... computability.
 Derives from Greek words meaning Love of Wisdom.
Acquiring Knowledge in Science. Some Questions  What is science and how does it work?  Create a list of words to describe science  Which ways of knowing.
Quantum One: Lecture 7. The General Formalism of Quantum Mechanics.
Mathematics and TOK Exploring the Areas of Knowlege.
Mathematics and the Theory of Knowledge
C OURSE : D ISCRETE STRUCTURE CODE : ICS 252 Lecturer: Shamiel Hashim 1 lecturer:Shamiel Hashim second semester Prepared by: amani Omer.
Epistemology Revision
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
Math 3121 Abstract Algebra I Section 0: Sets. The axiomatic approach to Mathematics The notion of definition - from the text: "It is impossible to define.
MATH 224 – Discrete Mathematics
DECIDABILITY OF PRESBURGER ARITHMETIC USING FINITE AUTOMATA Presented by : Shubha Jain Reference : Paper by Alexandre Boudet and Hubert Comon.
Logic in Computer Science - Overview Sep 1, 2011 POSTECH 박성우.
Chapter 3 – Set Theory  .
Aquinas’ Proofs The five ways.
1 CO Games Development 2 Week 21 Turing Machines & Computability Gareth Bellaby.
The Recursion Theorem Pages 217– ADVANCED TOPICS IN C O M P U T A B I L I T Y THEORY.
Institute for Experimental Physics University of Vienna Institute for Quantum Optics and Quantum Information Austrian Academy of Sciences Undecidability.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 5: Classical Logic.
LOGIC AND ONTOLOGY Both logic and ontology are important areas of philosophy covering large, diverse, and active research projects. These two areas overlap.
Lecture 18. Unsolvability Before the 1930’s, mathematics was not like today. Then people believed that “everything true must be provable”. (More formally,
Course Overview and Road Map Computability and Logic.
2010 Virginia Science SOL. Equipped with his five senses, man explores the universe around him and calls the adventure Science.
An Inquiry Concerning Human Understanding
HUME ON THE COSMOLOGICAL ARGUMENT Text source: Dialogues Concerning Natural Religion, part 9.
Reasoning Under Uncertainty. 2 Objectives Learn the meaning of uncertainty and explore some theories designed to deal with it Find out what types of errors.
Artificial Intelligence “Introduction to Formal Logic” Jennifer J. Burg Department of Mathematics and Computer Science.
Logic UNIT 1.
Anselm’s “1st” ontological argument Something than which nothing greater can be thought of cannot exist only as an idea in the mind because, in addition.
Lecture №1 Role of science in modern society. Role of science in modern society.
Building Blocks of Scientific Research Chapter 5 References:  Business Research (Duane Davis)  Business Research Methods (Cooper/Schindler) Resource.
CS104:Discrete Structures Chapter 2: Proof Techniques.
Critical Theory and Philosophy “The philosophers have only interpreted the world, in various ways; the point, however, is to change it” Marx, Theses on.
I think therefore I am - Rene Descartes. REASON (logic) It has been said that man is a rational animal. All my life I have been searching for evidence.
Mathematics and TOK Exploring the Areas of Knowlege.
Aids to Formulating and Answering Key Questions NameWhen to use u Construction Methodproving “there exists” u Choose Method proving “for every” u Math.
Week 7 - Wednesday.  What did we talk about last time?  Proving the subset relationship  Proving set equality  Set counterexamples  Laws of set algebra.
Philosophy of Science Lars-Göran Johansson Department of philosophy, Uppsala University
Chapter 3 Language Acquisition: A Linguistic Treatment Jang, HaYoung Biointelligence Laborotary Seoul National University.
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.
Modeling Arithmetic, Computation, and Languages Mathematical Structures for Computer Science Chapter 8 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesTuring.
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
Chapter 2 Sets and Functions.
Philosophy of Mathematics 1: Geometry
Homework: Friday Read Section 4.1. In particular, you must understand the proofs of Theorems 4.1, 4.2, 4.3, and 4.4, so you can do this homework. Exercises.
Quantum One.
A Brief Summary for Exam 1
On Kripke’s Alleged Proof of Church-Turing Thesis
Key Ideas How do scientists explore the world?
An example of the “axiomatic approach” from geometry
CO Games Development 2 Week 21 Turing Machines & Computability
God is not a Deceiver, Truth Criterion & Problem of Error
Presentation transcript:

STRUCTURAL PROOF THEORY: Uncovering capacities of the mathematical mind Wilfried Sieg Carnegie Mellon

Dedekind

Dedekind & Kronecker

Hilbert

Gödel & Turing

Hilbert, Zürich 1917 We must – that is my conviction – take the concept of the specifically mathematical proof as an object of investigation, just as the astronomer has to consider the movement of his position, the physicist must study the theory of his apparatus, and the philosopher criticizes reason itself.

Hilbert, Hamburg 1927 The fundamental idea of my proof theory is none other than to describe the activity of our understanding, to make a protocol of the rules according to which our thinking actually proceeds.

PART 1 Existential axiomatics

Hilbert, Paris 1900 To prove that they [i.e., the axioms of arithmetic] are not contradictory, that is, that a finite number of logical steps based upon them can never lead to contradictory results.

Hilbert’s structural definition We think a system of things; we call them numbers and denote them by a, b, c …. We think these numbers in certain mutual relations, the precise and complete description of which is given by the following axioms: …

Existence of an infinite system Without such a proof “it would remain doubtful, whether the concept of such a system does not perhaps contain internal contradictions.” Dedekind to Keferstein, 1890

…the relations or laws which are derived exclusively from the conditions [for a simply infinite system] and are therefore always the same in all ordered simply infinite systems, …. Dedekind 1888

Dedekind to Lipschitz All technical expressions [Kunst- ausdrücke] can be replaced by arbitrary, newly invented (up to now meaningless) words; the edifice must not collapse, if it is correctly constructed, and I claim that my theory of real numbers withstands this test.

PART 2 Formal proofs

Frege I do not mean that in a narrow sense, as if it were subject to an algorithm the same as … ordinary addition or multiplication, but only in the sense that there is an algorithm at all, i.e., a totality of rules which governs the transition from one sentence or from two sentences to a new one in such a way that nothing happens except in conformity with these rules.

Calculi A  A v BB  A v B (A  C)  (B  C)  (A v B  C)

Calculi A  A v BB  A v B (A  C)  (B  C)  (A v B  C)   A   B   A v B   A v B  A  C  B  C   C

Calculi   A   B  A v B   A v B  A v B  A  C  B  C  C

Calculi   A   B  A v B   A v B  A v B  A  C  B  C  C   A   B  A v B   A v B  A;   C  B;  C  C

Von Neumann, 1924 The undecidability is even the conditio sine qua non for the contemporary practice of mathematics, using as it does heuristic methods, to make any sense.

Von Neumann, 1924 The undecidability is even the conditio sine qua non for the contemporary practice of mathematics, using as it does heuristic methods, to make any sense. The very day on which the undecidability does not obtain any more, mathematics as we now understand it would cease to exist; …

Bidirectional reasoning Forward (from premises) by E-rules Example: argument by cases Backward (from a goal) by inverted I-rules Example: conditional proof

Local axiomatics I 1. Local axioms: representability, diagonal lemma, derivability conditions 2. Proof-specific definitions: Gödel and Löb sentences 3. Leading idea: moving between object- and meta-theory

PART 3 Conceptually structured search

Turing1948 That which is required in addition we call initiative. This statement will have to serve as definition. Our task is to discover the nature of this residue as it occurs in man, and try and copy it in machines.

Local axiomatics II 1. Local axioms: lemmata for injective, surjective and bijective functions 2. Proof-specific definitions: fixed-point; bijection in the main claim 3. Leading idea: define a 2-partition

Byrne’s diagram

Elementary geometric facts SAS Triangles are equal when they have the same base and when their third vertex lies on the same parallel to the base. A diagonal divides a rectangle into two equal triangles.

Byrne (with labels)

Local axiomatics III 1. Local axioms: the elementary geometric facts mentioned above 2. Proof-specific definitions: ??? 3. Leading idea: partitioning of squares into equal parts

Chinese argument

PART 4 Cognitive aspects

According to Dedekind (1854) The need to introduce new and appropriate notion arises ultimately from the fact that human intellectual powers are imperfect. Their limitation leads us to frame the object of a science in different forms and introducing a concept means, in a certain sense, formulating a hypothesis concerning the inner nature of a science.

Dedekind (1854) Essentially, there would be no more science for a man gifted with an unbounded understanding – a man for whom the final conclusions, which we obtain through a long chain of inferences, would be immediately evident truths; ….

Bernays 1946 In this way we recognize something like intelligence and reason that should not be regarded as a container of [items of] a priori knowledge, but as a mental activity that consists in reacting to given situations with the formation of experimentally applied categories.

Hilbert 1932

Proofs are not “mere collections of atomic processes, but rather complex combinations with a highly rational structure”.

There remains the real question of the actual structure of mathematical proofs and their strategy. It is a topic long given up by mathematical logicians, but one which still – properly handled – might give us some real insight.