Open main menu
Home
Random
Log in
Settings
About Conservapedia
Disclaimers
Conservapedia
Search
Changes
← Older edit
Newer edit →
Diagonalization
(view source)
Revision as of 02:27, June 15, 2008
6 bytes added
,
02:27, June 15, 2008
you don't need full AC, but at the very least countable.
Line 6:
Line 6:
We will now use [[proof by contradiction]] to show that the numbers in <math>[0,1]</math> are uncountable.
We will now use [[proof by contradiction]] to show that the numbers in <math>[0,1]</math> are uncountable.
−
Assume the numbers in [0,1], are countable. Then we can list them (
without use of
the [[Axiom of Choice]]) as such,
+
Assume the numbers in [0,1], are countable. Then we can list them (
using only
the
countable
[[Axiom of Choice]]) as such,
<math>
<math>
Foxtrot
4,781
edits