(Provably) Unprovable and Undisprovable... How??
No matter how hard we try to axiomatise mathematics, there will always be strong, independent propositions that don't need no proofs... but how do we show that a proposition can't be proven nor disproven? __________ Timestamps: 00:00 - Motivation(al) 01:14 - What is logical independence? 02:47 - An axiomatic foundation of "integers" 04:45 - A provable proposition 05:36 - An unprovable proposition 06:29 - An unprovable and undisprovable proposition 07:35 - The usual integers 08:35 - The undisprovability of the Freshman's Dream 10:08 - The big idea 10:41 - Thx 4 watching

▶︎
Solving one of the logic puzzles of all time!

▶︎
Weird Things Happen When Math Gets Too Expressive

▶︎
The Most Arrogant Science Book Ever Written

▶︎
The 7 Levels of Logical Thinking

▶︎
The FOUR Levels of Understanding Tensors: From Computer Science to Physics to Math

▶︎
Number Systems Invented to Solve the Hardest Problem - History of Rings | Ring Theory E0

▶︎
Algebra - It's not what you think it is!

▶︎
What does BLAZINGLY FAST even mean??

▶︎
An unhealthy addiction to academia

▶︎
Why care about differential forms? | Differential forms #1

▶︎
Can programmers do math? What is a real number, really?

▶︎
The Reasoning Test Psychologists Still Can't Explain

▶︎
I never understood why the Schrödinger's equation has an i...until now!

▶︎
Why Impressive-Mud5074 Doesn’t Believe in Pi

▶︎
WTF is Sheafification??

▶︎
A Swift Introduction to Geometric Algebra

▶︎
Solving a finite number problem using infinities

▶︎
What is a Monad? – Math vs Computer Science

▶︎
The Boundary of Computation

▶︎
