Re: Set Theory: Skolem's Paradox
Posted: June 14th, 2012, 11:36 am
Half-Six wrote:Yes, counting as a process that determines the cardinality of a finite set and countability as an extension of the notion of cardinality to certain infinite sets are different. If you disallow the set theory notion of countability, it becomes impossible to do certain proofs in set theory and consequently in the rest of mathematics. Notions of countability crop up in topology and analysis all the time and are quite useful.Prismatic wrote:The term countable in mathematics is a term of art for the cardinality of a set in 1-1 correspondence with the set of natural numbers. You are apparently taking it in a different sense entirely.What you’ve given here is what the term countable is, in set theory. Skolem was of the opinion that set theory ‘can't serve as a “foundation for mathematics”’ http://plato.stanford.edu/entries/paradox-skolem/, and as such what counting means in set theory is not the same as what it means in mathematics, or in ordinary English for that matter. There are two entirely different senses here.
As I’ve said above, Wittgenstein was of the same opinion – for him, counting doesn’t involve mapping onto an infinite set, counting is a procedure which outputs a finite set of numbers, the procedure itself is infinite because it doesn’t come to a built-in stop; wherever you get to, you can still keep going; the output isn't - infinity does not mean something that’s very, very huge and even bigger than that, that's just nonsense. There are no infinite sets of numbers, of whatever type (irrationals etc). Victor Rodych’s essay “Wittgenstein on Irrationals and Algorithmic Decidability” gives a thorough account of this.