Gödel's Incompleteness Visualizer

Visualize the fundamental limits of formal mathematical systems

What Is This?

Gödel's Incompleteness Theorems (1931) proved that any consistent mathematical system complex enough to include arithmetic contains true statements that cannot be proven within that system. It shattered the dream of a complete, self-verifying mathematics.

Think of a legal system that tries to write a law about all laws — it inevitably encounters rules that cannot be judged by its own courts.

Imagine a dictionary that must define every word using only words already in the dictionary — some meanings will always escape capture.

📐
Formal Systems
Axioms, rules, and theorems
🔢
Self-Reference
Statements about themselves
🤖
AI Limits
Can machines prove everything?
Infinity
Countable vs uncountable sets
🧩
Undecidability
Problems with no algorithm
💡
Metamathematics
Mathematics studying itself

Quick Start

Basic Parameters

Event Log

System ready. Build an axiomatic system and search for undecidable propositions...
Provable Theorems: 0
Undecidable Found: 0
System Strength: 1.00
Consistency: 100%
Proof Depth: 0
Gödel Number: 0
Time: 0.0s