HackerTube
HomeLongsLikedHistoryWatch laterCategoriesPlaylistsSettings

What if Current Foundations of Mathematics are Inconsistent? | Vladimir Voevodsky

Institute for Advanced Study3 HN recommenders · recommended in 3 months, 2017-2019
YouTube
57K views · 14 years ago · lecture · evergreen

Vladimir Voevodsky's IAS lecture starts from Godel's second incompleteness theorem to explore whether first-order arithmetic could be inconsistent. It motivates his vision of univalent foundations and computer-checked proofs.

Recommended as a thought-provoking lecture from a Fields medalist on the foundations of mathematics and formal proof verification.

Logic & formal methodsPure mathematics#voevodsky#incompleteness#univalentfoundations#proofassistants#logic

3 comments from Hacker News

@ukj2019 · in “A Programmer’s Regret: Neglecting Math at University”

Where Hilbert erred was looking for foundations in first-order logic. Univalent foundations are laid on high-order logic. It's the distinction between top-down and bottom-up thinking. If you are into philosophy/epistemology - it's somewhat of an attempt to shift Mathematics from foundationalism towards structuralism. I recommend this video: ▶ this video Hilbert's dream of Metamathematics has sort of come true in the form of homoiconicity in programming languages.

RecommendsView on HN
@IngoBlechschmid2018 · in “Mystery Math Whiz and Novelist Advance Permutation Problem”

> And indeed, this will likely always be the case, as the true purpose of proving a mathematical result is almost never to actually get the boolean true/false output, but to illustrate how to solve the problem in the first place and what methods were helpful for that. As a working mathematician, I wholeheartedly agree with the second part of the quoted sentence! But I think that the first part isn't quite right: The function of proofs to determine truth is extremely important, especially considering that, especially in pure mathematics, we often can't check our results in any other manner (like conducting physical experiments or checking many cases with the computer). Bad experiences with proofs which later turned out to be faulty led Voevodsky to initiate his univalent foundations program (also called homotopy type theory ), where all results should be checked by the computer. (For the particular area he was working on, no existing theorem prover turned out to be sufficient. He made a breakthrough in finding a new foundation to base theorem provers on, which made it possible to formalize results in his area of mathematics not only in principle, but also in practice.) The hope is also that with computer-checked proofs, we can advance to new areas of mathematics which are currently inprenetable to our puny human minds. I'm very much looking forward to this future! You can learn more about Voevodsky's vision in slides of him and in a recorded lecture: link ▶ this video

RecommendsView on HN
@Ericson23142017 · in “How a destructive idea paved the way for modern math”

Yes we must take saxioms on faith alone. Embrace pluralism and move on. ▶ this video by the late great Voedvodvosky is more interesting.

RecommendsView on HN
Math's Fundamental Flaw34:00

Math's Fundamental Flaw

Veritasium
30.8M views • 5 years ago
Five Stages of Accepting Constructive Mathematics - Andrej Bauer57:32

Five Stages of Accepting Constructive Mathematics - Andrej Bauer

Institute for Advanced Study
34K views • 10 years ago
"Propositions as Types" by Philip Wadler42:43

"Propositions as Types" by Philip Wadler

Strange Loop Conference
143K views • 11 years ago
The Banach–Tarski Paradox24:14

The Banach–Tarski Paradox

Vsauce
49.1M views • 11 years ago
Pythagoras' theorem (a) | Math History | NJ Wildberger48:55

Pythagoras' theorem (a) | Math History | NJ Wildberger

Insights into Mathematics
517K views • 15 years ago
The Future of Mathematics?1:14:48

The Future of Mathematics?

Microsoft Research
116K views • 7 years ago
How An Infinite Hotel Ran Out Of Room6:07

How An Infinite Hotel Ran Out Of Room

Veritasium
38.5M views • 5 years ago
MIT Godel Escher Bach Lecture 11:02:34

MIT Godel Escher Bach Lecture 1

jasonofthel33t
557K views • 13 years ago
Stanford Lecture: Don Knuth—"A Conjecture That Had To Be True" (2017)1:07:02

Stanford Lecture: Don Knuth—"A Conjecture That Had To Be True" (2017)

Stanford Online
30K views • 8 years ago
The Strange Math That Predicts (Almost) Anything32:32

The Strange Math That Predicts (Almost) Anything

Veritasium
13.1M views • 1 year ago
Category Theory in Life - Eugenia Cheng40:39

Category Theory in Life - Eugenia Cheng

Lambda World
113K views • 9 years ago
1. Introduction, Finite Automata, Regular Expressions1:00:34

1. Introduction, Finite Automata, Regular Expressions

MIT OpenCourseWare
626K views • 5 years ago
Philip Wadler  - Propositions as Types (Lambda Days 2016)56:58

Philip Wadler - Propositions as Types (Lambda Days 2016)

Erlang Solutions
20K views • 10 years ago
Turing & The Halting Problem - Computerphile6:14

Turing & The Halting Problem - Computerphile

Computerphile
919K views • 12 years ago
Scott Aaronson | How Much Math Is Knowable?1:06:43

Scott Aaronson | How Much Math Is Knowable?

Harvard CMSA
58K views • 1 year ago
Bayes theorem, the geometry of changing beliefs15:11

Bayes theorem, the geometry of changing beliefs

3Blue1Brown
6M views • 6 years ago
The Simple Essence of Automatic Differentiation - Conal Elliott1:30:45

The Simple Essence of Automatic Differentiation - Conal Elliott

Microsoft Research
17K views • 8 years ago
Edward Kmett - Type Classes vs. the World1:42:53

Edward Kmett - Type Classes vs. the World

Boston Haskell
36K views • 11 years ago
Real Analysis, Lecture 1: Constructing the Rational Numbers1:02:06

Real Analysis, Lecture 1: Constructing the Rational Numbers

HarveyMuddCollegeEDU
613K views • 16 years ago
Brian Beckman: Don't fear the Monad1:07:10

Brian Beckman: Don't fear the Monad

jasonofthel33t
415K views • 13 years ago