|
|
#11 |
|
FFR Hall of Fame
|
1 + 1 == 2 is an unprovable operation in any numerical system. It can be defined or proven from other axioms (such as Zermelo-Fraenkel Set Theory + Axiom of Choice); however, it can only be shown as a consistent statement in inconsistent systems.
But let's not go into Gödel's theories here, they would make all of your heads explode.
__________________
![]()
|
|
|
| Currently Active Users Viewing This Thread: 1 (0 members and 1 guests) | |
|
|