SlideShare a Scribd company logo
1 of 44
Uncertainty Trumps Determinism: Godel’s Incompleteness Theorem’s and Hilbert’s Program BAE Technical Seminar
David Hilbert Kurt Godel Bertrand Russell Alfred Whitehead Georg Cantor The Founders of the Modern Mathematical Foundation
[object Object],[object Object],[object Object],Grundlagenkrise der Mathematik
Avoiding Paradox or Embracing it? ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
Hilbert’s Second Problem (1900) ,[object Object]
Hilbert’s Program (circa 1921) ,[object Object]
Hilbert’s Program ,[object Object],[object Object]
Hilbert’s Program ,[object Object],[object Object]
Godel’s Answer to Hilbert’s Program (1931) ,[object Object],[object Object]
A Simple Language for a Godelian Problem –  Is Printable ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
Is Printable ,[object Object],[object Object],[object Object],[object Object]
Is Printable ,[object Object]
Is Printable ,[object Object],[object Object]
Is Printable ,[object Object],[object Object],[object Object]
Is Printable ,[object Object],[object Object],[object Object],[object Object]
Unprovable, Unrefutable, Undecidable ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
A Simple Godel Numbering ,[object Object],[object Object],[object Object],[object Object]
An Abstract Language,  L , for Godel logic ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
[object Object],[object Object]
[object Object],[object Object],[object Object]
[object Object],[object Object],[object Object],[object Object]
[object Object],[object Object],[object Object],[object Object],[object Object]
Godel Numbering and Diagonalization ,[object Object],[object Object],[object Object],[object Object],[object Object]
Why  Diagonal ?
Why  Diagonal ? ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Georg Cantor published his diagonal argument in 1891. It’s a method for demonstrated that there are undenumerable sets of numbers.
Why  Diagonal ? ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],It’s possible to construct a sequence that is different in the from all other sequences in the matrix, e.g.: s ω+1  =  (1, 0, 1, 1, 1, 0, 1, …)
Why  Diagonal ? ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],It’s possible to construct a sequence that is different in the from all other sequences in the matrix, e.g.: s ω+1  =  (1, 0, 1, 1, 1, 0, 1, …)*
The Diagonalization Function ,[object Object],[object Object],[object Object],[object Object]
Theorem 1 ,[object Object],[object Object],[object Object]
Proof of Theorem 1 ,[object Object],[object Object],[object Object],[object Object]
[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
[object Object],[object Object],[object Object]
The Set  T , Expressibility ,[object Object],[object Object],[object Object],[object Object]
[object Object],[object Object],[object Object],[object Object],[object Object]
Decidability ,[object Object],[object Object],[object Object],[object Object]
Incompleteness ,[object Object],[object Object],[object Object]
Refutability ,[object Object],[object Object]
Alternative to Theorem 1 ,[object Object],[object Object]
Expressibility as a Metaphor for Arithmetic ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
Correctness versus Consistency ,[object Object],[object Object],[object Object]
Godel’s 2 nd  Incompleteness Theorem ,[object Object],[object Object]
How’d it Work out for Hilbert’s Program? ,[object Object],[object Object],[object Object],[object Object]
Godels First Incompleteness Theorem

More Related Content

What's hot

Rules of inference
Rules of inferenceRules of inference
Rules of inferenceLakshmi R
 
Chapter 1 Logic of Compound Statements
Chapter 1 Logic of Compound StatementsChapter 1 Logic of Compound Statements
Chapter 1 Logic of Compound Statementsguestd166eb5
 
Predicate Logic
Predicate LogicPredicate Logic
Predicate Logicgiki67
 
Properties of Caputo Operator and Its Applications to Linear Fractional Diffe...
Properties of Caputo Operator and Its Applications to Linear Fractional Diffe...Properties of Caputo Operator and Its Applications to Linear Fractional Diffe...
Properties of Caputo Operator and Its Applications to Linear Fractional Diffe...IJERA Editor
 
Logic and proof
Logic and proofLogic and proof
Logic and proofSuresh Ram
 
Pigeonhole Principle,Cardinality,Countability
Pigeonhole Principle,Cardinality,CountabilityPigeonhole Principle,Cardinality,Countability
Pigeonhole Principle,Cardinality,CountabilityKiran Munir
 
Riemann integration
Riemann integrationRiemann integration
Riemann integrationRahul_Raj_1
 
Unit I discrete mathematics lecture notes
Unit I  discrete mathematics lecture notesUnit I  discrete mathematics lecture notes
Unit I discrete mathematics lecture notesGIRIM8
 
A Review Article on Fixed Point Theory and Its Application
A Review Article on Fixed Point Theory and Its ApplicationA Review Article on Fixed Point Theory and Its Application
A Review Article on Fixed Point Theory and Its Applicationijtsrd
 
Discrete Math Chapter 1 :The Foundations: Logic and Proofs
Discrete Math Chapter 1 :The Foundations: Logic and ProofsDiscrete Math Chapter 1 :The Foundations: Logic and Proofs
Discrete Math Chapter 1 :The Foundations: Logic and ProofsAmr Rashed
 
Partial-Orderings in Discrete Mathematics
 Partial-Orderings in Discrete Mathematics Partial-Orderings in Discrete Mathematics
Partial-Orderings in Discrete MathematicsMeghaj Mallick
 
Linear Congruences, reduced residue systems.pptx
Linear Congruences, reduced residue systems.pptxLinear Congruences, reduced residue systems.pptx
Linear Congruences, reduced residue systems.pptxKuparala Vidyasagar
 
Theory of Relational Calculus and its Formalization
Theory of Relational Calculus and its FormalizationTheory of Relational Calculus and its Formalization
Theory of Relational Calculus and its FormalizationYoshihiro Mizoguchi
 
Lecture 2 predicates quantifiers and rules of inference
Lecture 2 predicates quantifiers and rules of inferenceLecture 2 predicates quantifiers and rules of inference
Lecture 2 predicates quantifiers and rules of inferenceasimnawaz54
 

What's hot (20)

Rules of inference
Rules of inferenceRules of inference
Rules of inference
 
Chapter 1 Logic of Compound Statements
Chapter 1 Logic of Compound StatementsChapter 1 Logic of Compound Statements
Chapter 1 Logic of Compound Statements
 
Predicate Logic
Predicate LogicPredicate Logic
Predicate Logic
 
Properties of Caputo Operator and Its Applications to Linear Fractional Diffe...
Properties of Caputo Operator and Its Applications to Linear Fractional Diffe...Properties of Caputo Operator and Its Applications to Linear Fractional Diffe...
Properties of Caputo Operator and Its Applications to Linear Fractional Diffe...
 
Abstract Algebra
Abstract AlgebraAbstract Algebra
Abstract Algebra
 
Logic and proof
Logic and proofLogic and proof
Logic and proof
 
Pigeonhole Principle,Cardinality,Countability
Pigeonhole Principle,Cardinality,CountabilityPigeonhole Principle,Cardinality,Countability
Pigeonhole Principle,Cardinality,Countability
 
Abstract algebra - Algebraic closed field, unit - 2 , M.Sc. l semester Maths
Abstract algebra -  Algebraic closed field, unit - 2 , M.Sc. l semester Maths Abstract algebra -  Algebraic closed field, unit - 2 , M.Sc. l semester Maths
Abstract algebra - Algebraic closed field, unit - 2 , M.Sc. l semester Maths
 
What is sparse matrix
What is sparse matrixWhat is sparse matrix
What is sparse matrix
 
Riemann integration
Riemann integrationRiemann integration
Riemann integration
 
Unit I discrete mathematics lecture notes
Unit I  discrete mathematics lecture notesUnit I  discrete mathematics lecture notes
Unit I discrete mathematics lecture notes
 
Group Theory
Group TheoryGroup Theory
Group Theory
 
A Review Article on Fixed Point Theory and Its Application
A Review Article on Fixed Point Theory and Its ApplicationA Review Article on Fixed Point Theory and Its Application
A Review Article on Fixed Point Theory and Its Application
 
Discrete Math Chapter 1 :The Foundations: Logic and Proofs
Discrete Math Chapter 1 :The Foundations: Logic and ProofsDiscrete Math Chapter 1 :The Foundations: Logic and Proofs
Discrete Math Chapter 1 :The Foundations: Logic and Proofs
 
Generating function
Generating functionGenerating function
Generating function
 
Partial-Orderings in Discrete Mathematics
 Partial-Orderings in Discrete Mathematics Partial-Orderings in Discrete Mathematics
Partial-Orderings in Discrete Mathematics
 
Rough K Means - Numerical Example
Rough K Means - Numerical ExampleRough K Means - Numerical Example
Rough K Means - Numerical Example
 
Linear Congruences, reduced residue systems.pptx
Linear Congruences, reduced residue systems.pptxLinear Congruences, reduced residue systems.pptx
Linear Congruences, reduced residue systems.pptx
 
Theory of Relational Calculus and its Formalization
Theory of Relational Calculus and its FormalizationTheory of Relational Calculus and its Formalization
Theory of Relational Calculus and its Formalization
 
Lecture 2 predicates quantifiers and rules of inference
Lecture 2 predicates quantifiers and rules of inferenceLecture 2 predicates quantifiers and rules of inference
Lecture 2 predicates quantifiers and rules of inference
 

Viewers also liked

Incompleteness for Startups
Incompleteness for StartupsIncompleteness for Startups
Incompleteness for Startupsblackbox
 
How Quaint the Ways of Paradox
How Quaint the Ways of ParadoxHow Quaint the Ways of Paradox
How Quaint the Ways of ParadoxPat Hayes
 
GEB Gödel, Escher, Bach: An Eternal Golden Braid
GEB Gödel, Escher, Bach: An Eternal Golden BraidGEB Gödel, Escher, Bach: An Eternal Golden Braid
GEB Gödel, Escher, Bach: An Eternal Golden Braidgordana comic
 
A Machine-Assisted Proof of Gödel's Incompleteness Theorems
A Machine-Assisted Proof of Gödel's Incompleteness TheoremsA Machine-Assisted Proof of Gödel's Incompleteness Theorems
A Machine-Assisted Proof of Gödel's Incompleteness TheoremsLawrence Paulson
 
Incompleteness without Godel Numberings
Incompleteness without Godel NumberingsIncompleteness without Godel Numberings
Incompleteness without Godel NumberingsSatvik Beri
 
Incompleteness Theorems: Logical Necessity of Inconsistency
Incompleteness Theorems:  Logical Necessity of InconsistencyIncompleteness Theorems:  Logical Necessity of Inconsistency
Incompleteness Theorems: Logical Necessity of InconsistencyCarl Hewitt
 
The incompleteness of reason
The incompleteness of reasonThe incompleteness of reason
The incompleteness of reasonSubhayan Mukerjee
 
Chapter 3b miller_indices
Chapter 3b miller_indicesChapter 3b miller_indices
Chapter 3b miller_indiceschenna raidu c
 

Viewers also liked (10)

Incompleteness for Startups
Incompleteness for StartupsIncompleteness for Startups
Incompleteness for Startups
 
How Quaint the Ways of Paradox
How Quaint the Ways of ParadoxHow Quaint the Ways of Paradox
How Quaint the Ways of Paradox
 
QM philosophy talk
QM philosophy talkQM philosophy talk
QM philosophy talk
 
GEB Gödel, Escher, Bach: An Eternal Golden Braid
GEB Gödel, Escher, Bach: An Eternal Golden BraidGEB Gödel, Escher, Bach: An Eternal Golden Braid
GEB Gödel, Escher, Bach: An Eternal Golden Braid
 
A Machine-Assisted Proof of Gödel's Incompleteness Theorems
A Machine-Assisted Proof of Gödel's Incompleteness TheoremsA Machine-Assisted Proof of Gödel's Incompleteness Theorems
A Machine-Assisted Proof of Gödel's Incompleteness Theorems
 
Computability
Computability Computability
Computability
 
Incompleteness without Godel Numberings
Incompleteness without Godel NumberingsIncompleteness without Godel Numberings
Incompleteness without Godel Numberings
 
Incompleteness Theorems: Logical Necessity of Inconsistency
Incompleteness Theorems:  Logical Necessity of InconsistencyIncompleteness Theorems:  Logical Necessity of Inconsistency
Incompleteness Theorems: Logical Necessity of Inconsistency
 
The incompleteness of reason
The incompleteness of reasonThe incompleteness of reason
The incompleteness of reason
 
Chapter 3b miller_indices
Chapter 3b miller_indicesChapter 3b miller_indices
Chapter 3b miller_indices
 

Similar to Godels First Incompleteness Theorem

Jarrar.lecture notes.aai.2011s.ch8.fol.introduction
Jarrar.lecture notes.aai.2011s.ch8.fol.introductionJarrar.lecture notes.aai.2011s.ch8.fol.introduction
Jarrar.lecture notes.aai.2011s.ch8.fol.introductionPalGov
 
Propositional logic is a good vehicle to introduce basic properties of logic
Propositional logic is a good vehicle to introduce basic properties of logicPropositional logic is a good vehicle to introduce basic properties of logic
Propositional logic is a good vehicle to introduce basic properties of logicpendragon6626
 
A new proof that the set of complex
A new proof that the set of complexA new proof that the set of complex
A new proof that the set of complexcseij
 
Winter 10 Undecidability.pptx
Winter 10 Undecidability.pptxWinter 10 Undecidability.pptx
Winter 10 Undecidability.pptxHarisPrince
 
Introduction to Calculus 1
Introduction to Calculus 1Introduction to Calculus 1
Introduction to Calculus 1David Rogers
 
ANOTHER PROOF OF THE DENUMERABILITY OF THE COMPLEX NUMBERS
ANOTHER PROOF OF THE DENUMERABILITY OF THE COMPLEX NUMBERSANOTHER PROOF OF THE DENUMERABILITY OF THE COMPLEX NUMBERS
ANOTHER PROOF OF THE DENUMERABILITY OF THE COMPLEX NUMBERScsandit
 
1606751772-ds-lecture-6.ppt
1606751772-ds-lecture-6.ppt1606751772-ds-lecture-6.ppt
1606751772-ds-lecture-6.pptTejasAditya2
 
Discreate structure presentation introduction
Discreate structure presentation introductionDiscreate structure presentation introduction
Discreate structure presentation introductionyashirraza123
 
DIGITAL TEXT BOOK
DIGITAL TEXT BOOKDIGITAL TEXT BOOK
DIGITAL TEXT BOOKbintu55
 
hghghghhghghgggggggggggggggggggggggggggggggggg
hghghghhghghgggggggggggggggggggggggggggggggggghghghghhghghgggggggggggggggggggggggggggggggggg
hghghghhghghggggggggggggggggggggggggggggggggggadugnanegero
 
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...ijscmcj
 

Similar to Godels First Incompleteness Theorem (20)

Jarrar.lecture notes.aai.2011s.ch8.fol.introduction
Jarrar.lecture notes.aai.2011s.ch8.fol.introductionJarrar.lecture notes.aai.2011s.ch8.fol.introduction
Jarrar.lecture notes.aai.2011s.ch8.fol.introduction
 
Predicate Logic
Predicate LogicPredicate Logic
Predicate Logic
 
Propositional logic is a good vehicle to introduce basic properties of logic
Propositional logic is a good vehicle to introduce basic properties of logicPropositional logic is a good vehicle to introduce basic properties of logic
Propositional logic is a good vehicle to introduce basic properties of logic
 
True but Unprovable
True but UnprovableTrue but Unprovable
True but Unprovable
 
A new proof that the set of complex
A new proof that the set of complexA new proof that the set of complex
A new proof that the set of complex
 
Winter 10 Undecidability.pptx
Winter 10 Undecidability.pptxWinter 10 Undecidability.pptx
Winter 10 Undecidability.pptx
 
Introduction to Calculus 1
Introduction to Calculus 1Introduction to Calculus 1
Introduction to Calculus 1
 
Lesson1
Lesson1Lesson1
Lesson1
 
DM(1).pptx
DM(1).pptxDM(1).pptx
DM(1).pptx
 
ANOTHER PROOF OF THE DENUMERABILITY OF THE COMPLEX NUMBERS
ANOTHER PROOF OF THE DENUMERABILITY OF THE COMPLEX NUMBERSANOTHER PROOF OF THE DENUMERABILITY OF THE COMPLEX NUMBERS
ANOTHER PROOF OF THE DENUMERABILITY OF THE COMPLEX NUMBERS
 
Discrete Math Lecture 02: First Order Logic
Discrete Math Lecture 02: First Order LogicDiscrete Math Lecture 02: First Order Logic
Discrete Math Lecture 02: First Order Logic
 
1606751772-ds-lecture-6.ppt
1606751772-ds-lecture-6.ppt1606751772-ds-lecture-6.ppt
1606751772-ds-lecture-6.ppt
 
Discreate structure presentation introduction
Discreate structure presentation introductionDiscreate structure presentation introduction
Discreate structure presentation introduction
 
DIGITAL TEXT BOOK
DIGITAL TEXT BOOKDIGITAL TEXT BOOK
DIGITAL TEXT BOOK
 
Analysis of algorithms
Analysis of algorithmsAnalysis of algorithms
Analysis of algorithms
 
hghghghhghghgggggggggggggggggggggggggggggggggg
hghghghhghghgggggggggggggggggggggggggggggggggghghghghhghghgggggggggggggggggggggggggggggggggg
hghghghhghghgggggggggggggggggggggggggggggggggg
 
03 propsem
03 propsem03 propsem
03 propsem
 
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
 
APAL2032
APAL2032APAL2032
APAL2032
 
H-MLQ
H-MLQH-MLQ
H-MLQ
 

Godels First Incompleteness Theorem

  • 1. Uncertainty Trumps Determinism: Godel’s Incompleteness Theorem’s and Hilbert’s Program BAE Technical Seminar
  • 2. David Hilbert Kurt Godel Bertrand Russell Alfred Whitehead Georg Cantor The Founders of the Modern Mathematical Foundation
  • 3.
  • 4.
  • 5.
  • 6.
  • 7.
  • 8.
  • 9.
  • 10.
  • 11.
  • 12.
  • 13.
  • 14.
  • 15.
  • 16.
  • 17.
  • 18.
  • 19.
  • 20.
  • 21.
  • 22.
  • 23.
  • 25.
  • 26.
  • 27.
  • 28.
  • 29.
  • 30.
  • 31.
  • 32.
  • 33.
  • 34.
  • 35.
  • 36.
  • 37.
  • 38.
  • 39.
  • 40.
  • 41.
  • 42.
  • 43.