|
|
| (2 intermediate revisions by 2 users not shown) |
| Line 1: |
Line 1: |
| − | I deleted the part that said that for no infinite set was there a bijection between the set and its power set. I am fairly certain that this is undecided. It certainly is known that the proposition <math>\displaystyle 2^{\aleph _{n} } = \aleph _{ n+1 }</math> is undecidable, so I am very suspicious of a proposition that such a cardinality as <math>\displaystyle \aleph _{n>1} </math> exists at all. Or are these cardinalities known to exist after all? If so, how are they defined? —[[User:Boy Soprano II|Boy Soprano II]] 21:35, 26 August 2006 (EDT)
| + | {{AotD tag|January 25th, 2008}} |
| − | | + | I claimed that that proof doesn't rely on the axiom of choice: is this really true? --[[User:JBL|JBL]] 11:56, 7 September 2006 (EDT) |
| − | It is true (and decidable) that there is no bijection between a set and its power set. --[[User:ComplexZeta|ComplexZeta]] 21:45, 26 August 2006 (EDT)
| |
| − | | |
| − | Really? Where can I find a proof? Thanks. —[[User:Boy Soprano II|Boy Soprano II]] 21:53, 26 August 2006 (EDT)
| |
| − | | |
| − | See the bottom of http://en.wikipedia.org/wiki/Cantor%27s_diagonal_argument --[[User:ComplexZeta|ComplexZeta]] 01:25, 27 August 2006 (EDT)
| |
Latest revision as of 19:35, 25 January 2008
I claimed that that proof doesn't rely on the axiom of choice: is this really true? --JBL 11:56, 7 September 2006 (EDT)
