12/02/2014, 02:40 PM

I'm not really sure that is that easy...

The problem is that cardinals and ordinals are different and we need a good recursive definition of the tetration over the cardinals.

I mean, is true that but we have also that every transfinite ordinal below is countable and thus has cardinality

and I guess that we always have

For example, all the epsilon ordinals are countable.

Back to the topic. Tommy, when you say inaccessible ordinal you mean "strongly inaccesible" cardinals right? The ones that give us models of ZFC?

I don't even understand how you can take the natural logarithm of a cardinal number...

Note also that cardinal and ordinal exponentiation aren't the same.

The problem is that cardinals and ordinals are different and we need a good recursive definition of the tetration over the cardinals.

I mean, is true that but we have also that every transfinite ordinal below is countable and thus has cardinality

and I guess that we always have

For example, all the epsilon ordinals are countable.

Back to the topic. Tommy, when you say inaccessible ordinal you mean "strongly inaccesible" cardinals right? The ones that give us models of ZFC?

I don't even understand how you can take the natural logarithm of a cardinal number...

Note also that cardinal and ordinal exponentiation aren't the same.

MathStackExchange account:MphLee