@stephenpetro411: In the 1920s, the most powerful mathematician alive had a dream that would have changed human knowledge forever. David Hilbert wanted to put all of mathematics on a perfect foundation — one system of axioms that could prove every true statement, never contradict itself, and prove its own reliability. In 1931, a twenty-five-year-old logician named Kurt Gödel destroyed that dream with essentially one sentence. He took the liar's paradox — "this sentence is false" — and changed a single word. He built a statement that says: "this statement cannot be proved within this system." But he did it in pure math, not words. If the system can prove it, it has proved something claiming it can't be proved — a contradiction. If it can't prove it, then the sentence is true, exactly as it says. True, and unprovable, inside the very system built to prove all truths. That's Gödel's First Incompleteness Theorem: any system powerful enough for basic arithmetic contains true statements it can never prove. The dream of a complete, self-contained mathematics was dead — and it's shaped physics, computing, and nearly every field since. Follow @thinkitthrough411 for more! #Mathematics #Logic #Philosophy #HistoryTiktokContest #EdutokContest

toda :

Roger Penros loved Godel theorem so much.

Eurjxbeiwl42 :

My favorite hotel.

Susu Bribi :

Sounds trivial. How’s that a discovery? 😹

Turi :

no è stato Peano😂

Trudge :

Keep up your work

user1119540486619 :

No power entity can grow to have absolute power, otherwise it will assimilate or destroy all other entities , and the world will come to an end. There are no absolute truth either, just perspectivism...

865695 :

Bluevoter9997 :

Total genius

faura72 :

I tried but I couldn't understand Godel's incompetent's theory, the contradiction

ProfessorLogic :

the liars paradox is an engineering limit of a 2 element logic. its essentials V=NOT(v) where NOT(V)=1-V for all elements in the carrier (0,1) this causes an ocilating value that cant find closure in the carrier. the moment you increase to a multi valued logic, the paradox dissolves. (0,0.5,1) here V=NOT(v) can find closure. because NOT(0.5) = 1-0.5=0.5 0.5 is its own opposite. when your value space for truth is binary by design, the LNC and EM are the result of mathematical enumeration. they are forced by the value space. change the value space and you change what can be "true" in your system. the result of engineering choices, not discovered ontological limits.