Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Oops, that should have read, "There must be a first countable ordinal beta at which there are no unclaimed members of J; the player whose turn it is at beta is defined as the winner.
(Cont'd.) Assume "whose turn it is" has been defined for all countable limit ordinals, and hence by alternation for all countable ordinals. Then it's not even necessary to predefine the length of the game. A simple example is this: let J be any countably infinite set. Each player on their turn claims some member of J. There must be a first countable ordinal at which the last member of J is claimed: the player who did that is defined as the winner. (I hope to expand on this soon in a short article.)
Incidentally, there's no reason that the plays of an infinite ordinal game must be indexed by omega. Any infinite ordinal lambda will do, though let's just be concerned about countable ordinals here. Special care must be taken to know whose turn it is at each play (whose index is some ordinal < lambda). This is easily accomplished in a "fair" way as long as whose turn it is is defined for limit ordinals; this is not difficult. (Successor ordinals just follow the alternating turn rule, as for the case lambda = omega.)
"... larger populations have more girls ..." No, since the population size is meaningful only if something is known about the number of families. In order to use the Strong Law of Large Numbers we assume infinitely many families #1,#2,#3,... with each one's sequence of births (G^n)B being concatenated in order of family #. Then the stochastic process generating this infinite sequence of G's and B's is isomorphic (up to measure 0) with repeated flips of a fair coin. Hence the SLLN implies the asymptotic fraction of B's or G's is 1/2, each with probability = 1. This is, to me, conclusive.
1. The words "a social convention cannot override biology" (not mine) mean just that the ultimate proportions of boys and girls are the same as the proportions in which boys and girls are born. 2. The stopping rule (in question) is a red herring because any stopping rule of the form "Stop as soon as a certain consecutive string of B's and G's occurs" will result in the same ratio of 1:1 (or more generally p:q) as the probabilities of B vs. G (or H vs. T) are in. 3. You are right that the 2:1 stopping rule is not almost certain to occur. Oops. 4. What modification are you thinking of?
There are many situations where one needs to speak of a set of two numbers that may or may not be equal. E.g.: "Let x<sub>1</sub>, x<sub>2</sub> ∈ ℝ. Then among all the open intervals containing the set {x<sub>1</sub>, x<sub>2</sub>}, none of them is contained in all the others." If one is addressing mathematicians, there is no need to specify that x<sub>1</sub> might be equal to x<sub>2</sub>.