So why not reject it in the finite case as well?
Actually, I would, but that's digressing from the subject of infinite lotteries. As I have been pointing out, infinite lotteries are outside the scope of the VNM axioms and need additional axioms to be defined. It seems no more reasonable to me to require completeness of the preference ordering over St. Petersburg lotteries than to require that all sequences of real numbers converge.
Care to assign a probability to that statement.
"True." At some point, probability always becomes subordinate to logic, which knows only 0 and 1. If you can come up with a system in which it's probabilities all the way down, write it up for a mathematics journal.
If you're going to cite this (which makes a valid point, but people usually repeat the password in place of understanding the idea), tell me what probability you assign to A conditional on A, to 1+1=2, and to an omnipotent God being able to make a weight so heavy he can't lift it.
"True." At some point, probability always becomes subordinate to logic, which knows only 0 and 1. If you can come up with a system in which it's probabilities all the way down, write it up for a mathematics journal.
Ok, so care to present an a priori pure logic argument for why St. Petersburg lottery-like situations can't exist.
Summary: the problem with Pascal's Mugging arguments is that, intuitively, some probabilities are just too small to care about. There might be a principled reason for ignoring some probabilities, namely that they violate an implicit assumption behind expected utility theory. This suggests a possible approach for formally defining a "probability small enough to ignore", though there's still a bit of arbitrariness in it.