/me didn't watch the video.
/me didn't watch the video.
In other words, there can be multiple next functions, but a set is countable iff there is at least one of them.
In plain English, you need to construct an infinite sequence (a,b,c,d,...) which (i) consists of elements of a set S (ii) contains every element of S at least once - sometimes many times over. We also allow the members of this sequence to equal an exceptional value we denote with an asterisk: *. This is to take into account the possibility that S may be an empty set. Without this exceptional value, such a sequence cannot exist if S is empty. If S has at least 1 element, then we don't need the exceptional value.
I don't know if this means you can sensibly talk about a "next" element. The problem is that an element of S might repeat. What you're describing sounds equally like a total ordering. Assuming the Axiom Of Choice, every set has a total ordering, but the indices are not in general natural numbers, but may be ordinal numbers. You cannot in general exhibit such a total ordering, because anything proved using the Axiom Of Choice is merely known to exist, but cannot always be computed or constructed.
If you take your sequence construction, then by removing duplicates from the sequence, this new sequence would allow finding a "next" element.
If I'm downvoted for not watching the video, I think that's mean. I was interested in the subject, but I'd prefer a transcript to a video.
For instance, if I give you the rational number 337/912 and ask "what's the next rational number?" there isn't a canonical answer. But the rational numbers are countable.
So the fact that there isn't a canonical answer to "what's the next real number?" doesn't tell us anything about whether or not the real numbers are countable.
(For the avoidance of doubt: in ordinary set theory with ordinary logic, the reals are definitely not countable. The research being reported on here looks at what happens when you weaken your logic, by throwing out the "law of the excluded middle", and weaken your set theory, by not having any form of the "axiom of choice". It turns out that in this case there are multiple things you might reasonably mean by "the real numbers", and for at least one of these you can no longer prove that they're uncountable, and we can tell this because there's a so-called topos in which "the real numbers" are countable. A topos is a sort of generalized "notion of what a set is", and if something is provable intuitionistically and without any version of the axiom of choice then it is true in every topos. I think. Something along those lines, anyway.)
I had no idea there were different ideas of what "real" meant, and it's my first encounter with the notion of a topos (other than a place: the "topos" was the toilet, the place where the boys went to piss at my boarding school).
[Edit] Also, I hadn't grokked that rationals were countable; but now you point it out, I guess they must be. Does countable imply enumerable?
With the restrictions being used here, though, the different definitions aren't all equivalent, and apparently it turns out that one version of "the real numbers" is necessarily countable and another isn't (because it's countable "in a particular topos").
"Countable" and "enumerable" are the same thing. (But there's a separate term, "recursively enumerable", that means something else.)
One way to see that the rational numbers are countable: write them down in a sort of square where m/n goes in position (m,n). You'll have e.g. 2/3 and 4/6 and 6/9 and ..., all in different places, but that's harmless. Then start at (1,1) and walk along the finite diagonals: 1/1, then 1/2, 2/1, then 1/3, 2/2, 3/1, etc. Boom, you've counted the rational numbers :-).