lavinia said:
Mathematicians generally view mathematics as unified rather than as separated into different mathematical worlds. I personally have difficulty even understanding what it would mean for there to be more than one mathematical world. Could you elaborate on that?
Well my formal background is computer science (though I never liked it ... obviously logic and metamath is seemingly more interesting for me), and my knowledge of logic and set theory is very little (so I won't invoke any of them directly). So I would give an answer based upon few things that I have an idea about.
Consider the set of ω-tape ITTMs. Given a blank tape an ITTM(that halts eventually) can go very far (and some will go further than the others). However, the maximum that the set of ITTMs can go has to be a countable. We can simply show this by giving an enumeration of the ω-tape ITTMs
[EDIT : Actually the countability argument will have to be more sophisticated than this. If we define a gap as a position where no program can halt then one would also have to prove that the gap widths are always equal to a countable ordinal
].
Before these programs, of course some of the ordinals involved were also defined before (purely in terms of logic). Using countability arguments (or similar) one could conclude that the involved ordinals were countable.
To some extent, before these kind of arguments is what I meant partially by the "uniformity of arguments" provided by the ideas such as uncountable.
But such programs also of course also generate a rich collection of subsets of ℕ. The interesting thing is that the collections formed are quite robust (it would be hard/impossible to think of a subset of ℕ outside the collection without explicitly thinking of a more powerful model or direct diagonalisation kind of thing).
Since you can't give an explicit well-order for Ω in terms of ℕ (by definition), it seems to me that a lot of views of largeness of world below Ω would inevitably come down to atleast some subjective opinion. And with this would also come the problem of collection of reals that we "really" admit (and how do we decide it).
I could be wrong, but it seems to me that a lot of
subjectivity part comes in here.
And this is without considering the case of ℝ not having cardinality aleph_1. How would we adjust this(card(ℝ)≠aleph_1) with our intuitive understanding that the collections of reals formed in bottom-up manner (going to arbitrarily large countable α's) are incredibly robust? I will admit my ignorance here tbh (maybe learning more set theory would help).
Regarding your point regarding mathematicians holding the "multiverse" view (I also have difficult time imagining it though), you might also search for it and I think you would find a lot of material of varying sophistication/level regarding it.
I would say that one can reasonably justify a lot of math (that would look a lot like traditional continuous math) to a very high confidence (essentially discovery) by restricting oneself to certain levels (but it seems that would also mean potentially missing upon some important ideas).
That's ofc ignoring the concerns in (1a) and (1b) of post#22. And even with enormous restrictions of (1a) it seems a fair amount continuous-like math can be done (analysis for example) ... just a little differently. One can find interesting literature on it.
==================
One idea that one "might" try (I don't know whether it is of trivial nature or not) is that try defining "reasonable-ness" of a function based upon the idea that, on top of a mathematical definition, there are at least some possibilities that one should be able to rule out reasonably. As an example consider the predicate Equivalent:ℕ
2→{0,1}. Equivalent(x,y) is evaluated true if program corresponding to index x and index y both compute the same function (and false otherwise). Even though algorithmically one can't evaluate this function for all inputs, we do know that we can easily rule out some "possibilities".
That is at least for "some" inputs we can do better than "the answer is either 0 or 1". For example just choose a few programs that are trivially non-equivalent or equivalent and write down 0 or 1 for those specific inputs. In some sense it seems that some of our confidence regarding a "good definition" of a subset of ℕ comes from being able to rule out atleast some possibilities.
But really, I am just putting this as a thought. I don't have a good idea whether the idea can made to turn out to be trivial(not useful) or interesting.
===================
As a historical aside (since a lot is being mentioned in this thread), you might want to see this:
Comments on the Foundations of Set Theory --- Paul Cohen
Edit:
I realized upon a bit of searching that lot of Physics related links come up. So I am posting a link (one is much less likely to find any elementary or intermediate level discussion about it), mostly so that some of the key terms are easier to identify:
http://www.logic.univie.ac.at/~antos/wp-content/uploads/2015/01/MCST_Synthese_Complete.pdf