Ben Banana
-
Posts
305 -
Joined
-
Last visited
Ben Banana's Achievements
Atom (5/13)
10
Reputation
Single Status Update
-
Goedel's Incompleteness Theorem. meh...
- Show previous comments 7 more
-
Basically, Godel proved that formal languages of sufficient complexity cannot be both consistent and complete. A consistent system is one in which it is not possible to prove a false statement. A complete system is one in which it is possible to prove all true statements.
The relevant languages are mathematics in general and some advanced logics.
- Show next comments 3 more