 Gödel: ‘How did you receive your revolutionary insights?’  Einstein: ‘By raising questions that children are told not to ask’.

Slides:



Advertisements
Similar presentations
Reasons for (prior) belief in Bayesian epistemology
Advertisements

Nature and Construction of Knowledge in Mathematics
Introductory Mathematics & Statistics for Business
Completeness and Expressiveness
Introduction to Proofs
PARADOX Chi-Kwong Li. A ‘ VISUAL ’ PARADOX : I LLUSION.
Possible World Semantics for Modal Logic
1 A formula in predicate logic An atom is a formula. If F is a formula then (~F) is a formula. If F and G are Formulae then (F /\ G), (F \/ G), (F → G),
Kaplan’s Theory of Indexicals
COUNTING AND PROBABILITY
Discovering HOPE in the midst of evil SUFFERING AND THE HIDDENNESS OF GOD.
CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 7: Beyond Classical Logic.
Philosophy 024: Big Ideas Prof. Robert DiSalle Talbot College 408, x85763 Office Hours: Monday and Wednesday.
Copyright © Cengage Learning. All rights reserved.
1 Introduction to Computability Theory Lecture15: Reductions Prof. Amos Israeli.
1 Introduction to Computability Theory Lecture12: Reductions Prof. Amos Israeli.
Logic and Set Theory.
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.
Models -1 Scientists often describe what they do as constructing models. Understanding scientific reasoning requires understanding something about models.
Me Talk Good One Day When Language and Logic Fail to Coincide.
Computability Thank you for staying close to me!! Learning and thinking More algorithms... computability.
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
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.
Discrete Mathematics and Its Applications
Dynamics of Theology Faith and the Community of Beliefs.
Induction and recursion
Lecture 2: The nature and value of knowledge. Two kinds of knowledge Both philosophy and common sense draw a distinction between knowing how, and knowing.
Reduction Episode 9 0 The operation of reduction and the relation of reducibility Examples of reductions The variety of reduction concepts and their systematization.
Between proof and truth Gabriel Sandu Univ. of Helsinki.
Introduction to Proofs
MAKING GOOD ARGUMENTS 5 Key Ters. The Logic of Everyday Life Conversation A: I hear last semester was difficult. How do you think this term will go? B:
MIDTERM EXAMINATION THE MIDTERM EXAMINATION WILL BE ON FRIDAY, MAY 2, IN THIS CLASSROOM, STARTING AT 1:00 P.M. BRING A BLUE BOOK. THE EXAM WILL COVER:
The Problem of Knowledge 2 Pages Table of Contents Certainty p – Radical doubt p Radical doubt Relativism p Relativism What should.
Advanced Topics in Propositional Logic Chapter 17 Language, Proof and Logic.
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.
We do not search for the meanings of things in the things themselves. Rather, we find meaning in the way we can relate things together, either through.
Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Jim Little UBC CS 322 – CSP October 20, 2014.
Copyright © Cengage Learning. All rights reserved. CHAPTER 7 FUNCTIONS.
Sept. 13, 2006Math 3621 Propositions. Sept. 13, 2006Math 3622 Propositions One way that mathematical language differs from ordinary everyday English (OEE)
Course Overview and Road Map Computability and Logic.
02 Truth and Rationality Philosophy. 2 Part I: Sentences and Propositions.
Activity 1-19: The Propositional Calculus
1 Methods of Proof Proof techniques in this handout –Direct proof –Division into cases –Proof by contradiction In this handout, the proof techniques will.
Theory and Applications
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.
LECTURE 19 THE COSMOLOGICAL ARGUMENT CONTINUED. THE QUANTUM MECHANICAL OBJECTION DEPENDS UPON A PARTICULAR INTERPRETATION WE MIGHT REASONABLY SUSPEND.
Naïve Set Theory. Basic Definitions Naïve set theory is the non-axiomatic treatment of set theory. In the axiomatic treatment, which we will only allude.
A logical puzzle Given situation: Three women stand behind each other. Each one carries a hat on her head and sees only the hats of the person(s) standing.
Friday 8 Sept 2006Math 3621 Axiomatic Systems Also called Axiom Systems.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
Incompleteness. System Relativity Soundness and completeness are properties of particular logical systems. There’s no sense to be made of the claim that.
1 Hypothesis Testing Basic Problem We are interested in deciding whether some data credits or discredits some “hypothesis” (often a statement about the.
COUNTERARGUMENTS (CAS). WHAT IS A COUNTERARGUMENT?  An argument or set of reasons put forward to oppose an idea or theory developed in another argument.
When things become undecidably complex. Within linear, one- dimensional thinking.
Chapter 11 Introduction to Computational Complexity Copyright © 2011 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1.
Mathematical Induction
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.
Section 1.7. Definitions A theorem is a statement that can be shown to be true using: definitions other theorems axioms (statements which are given as.
The inference and accuracy We learned how to estimate the probability that the percentage of some subjects in the sample would be in a given interval by.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–10: Soundness of Propositional Calculus 12 th August, 2010.
Complete the provided worksheet as you read Lessons 24 and 25 in your Student Manual over Values and Standards. Make sure you write your responses IN.
Axiomatic Number Theory and Gödel’s Incompleteness Theorems
Induction and recursion
Great Theoretical Ideas in Computer Science
Daniel W. Blackmon Theory of Knowledge Coral Gables Senior High
Mathematical Induction
An example of the “axiomatic approach” from geometry
Validity and Soundness, Again
Presentation transcript:

 Gödel: ‘How did you receive your revolutionary insights?’  Einstein: ‘By raising questions that children are told not to ask’.

 Gödel raised questions that mathematical logicians and philosophers weren’t supposed to ask.

 Peirceanly speaking (in order to introduce a variation of Gödel): 1. Generality is that which is accepted as true from the local perspective but possibly true and possibly false from the global perspective. A generality is, then, neither true nor false when considering both perspectives (i.e. it may be ‘falsified’ within some future timespace context). Hence classical logical principles don’t necessarily apply.

2. Particularities that are taken as true from a local perspective are not demonstrably true from the global perspective. Yet within that local perspective they are customarily construed as either true or false (i.e. classical logical principles tend to apply).

3. Possibilities stand a chance of emerging within some future timespace juncture; yet, as possibilities, some will contradict others; nevertheless, both one possibility and another mutually exclusive possibility can coexist as comfortable bedfellow. Hence classical logical principles don’t necessarily apply here either.

 How can these three apparently unruly misfits be brought together?

 Don Quixote sees a threatening ‘giant’. Sancho Panza sees a ‘windmill’. Who is right? Both, and neither. They are both right within their local perspective; neither is demonstrably right or wrong within the global perspective.  Cervantes’s fictional world is right within its particular perspective. But we can’t simply say it’s wrong when placed within the global, ‘real world’ perspective.

 In this light, what, then, is the nature of the fiction/‘real - world’ distinction with respect to Gödel’s proof?

 Jaako Hintikka (2000): Gödel numbering is like staging a play. The actors have their normal life outside the play, but they also have a role in the fiction in question. Consequently what they say in the play can be taken in at least two different ways: either as it would be understood in her everyday life, or as a line within the fictive world.

 Likewise, in Gödel numbering one and the same number string can be taken in two different ways: either as a proposition about numbers in their everyday life as numbers, or as a statement about the formulas that those same numbers represent when they play different characters in their Gödelian play.

 In both cases we are asked to ‘suspend our belief in the everyday domain’ and ‘suspend our disbelief in the imaginary domain’. We must take numbers or characters to be acting simultaneously in their natural and their artificial roles.

 In an alternative way of putting this, Zeno’s paradox holds within the local imaginary domain, and as long as we consider Achilles and the Tortoise to be actors within that domain, the Tortoise will always win (we suspended disbelief in the imaginary domain). However, within our own ‘real world’ we know that all we have to do is put the chimerical Achilles in hot pursuit of the Tortoise and it is a no contest (we suspended belief in our everyday domain by including an imaginary situation).

 Like Zeno’s paradox, Gödel’s sentence says of itself, ‘I am undecidable’, and within that domain there is no decidability; however, we can add another theorem to that domain and thus render it decidable; hence the ‘paradox’, testifying to its ‘inconsistency’, was merely ‘incomplete’, and it was we who imperiously ‘completed’ it; but now, the domain finds itself caught up in the same dilemma anew.

 Quixote says ‘Giant!’; Sancho says ‘Windmill!’, and within the domain Cervantes offers us there is no solution. However we ‘suspend disbelief’ in the fictive world and give Quixote the benefit of the doubt, or, we place stock in Sancho’s view. Yet, within the fictive domain undecidability ruled. Outside that domain, we would ordinarily opt for Sancho’s reality and Quixote’s dementia; yet, interpreted from another perspective, by ‘suspending our ordinary belief in our level- headed reason and logic’, we become aware of a little bit of Sancho and a little bit of Quixote in all of us, so the paradox remains.

 How do we resolve this apparent dilemma?

 The Gödel sentence is like a statement made by a character in a play about himself and at the same time about real people. Suppose Clint Eastwood says, playing a role in a movie, “In this situation even Clint Eastwood couldn’t keep a straight face”. This statement is part of the movie, not of real life. Yet the meaning and the truth of that statement have to be judged by reference to real persons, in this case Clint Eastwood, the actor.

 The truth or falsity of the fictive- character/real-life-person can only be decided by examining when the actual real-life person would smile in a certain situation, not when the fictive-character in a movie might break out in a grin. Likewise, the Gödelian sentence is a part of a self-referential play, and its truth or provability must be judged as if it were an ordinary arithmetical statement.

 Peirceanly speaking, once again: 1. A sentence may be considered true within a local perspective (i.e. ‘Atoms are indivisible spheres’), but its truth can’t be absolutely provable. From the global perspective it is neither true nor false, for at some future timespace juncture, there is no knowing which of the range of possible alternate sentences may be considered a more viable candidate (i.e. ‘Atoms are solid indivisible spheres, they are vortices, they are like a solar system, they are a probability amplitude, etc.).

2. A particular sentence, strictly within the norms of a local context, can be considered either true or false, with the stipulation that the sentence may turn out to be either inconsistent or incomplete or both within that local context.

3. The range of pure, unactualized possibilities holds the promise that, however inconsistent and/or incomplete the sentences within a particular context that have been given generality status may be, some alternate sentence will be available for selection at some future timespace context.