>>735-738 >>744
>スレ主よ、conglomerabilityとは何か説明してみろｗ
>ちなみに俺は理解したぞｗ

ピエロちゃんども
これはこれは、珍しく本格的だなｗ（＾＾
いいね〜（＾＾
長いけど、Alexander Pruss氏の本から抜粋するよ
ベースがないと、議論が上滑りだからね

https://books.google.co.jp/books?id=RXBoDwAAQBAJ&;pg=PA77&lpg=PA77&dq=%22conglomerability%22+assumption+math&source=bl&ots=8Ol1uFrjJQ&sig=ACfU3U1bAurNGJm5872wDblskzsSgsU0iA&hl=ja&sa=X&ved=2ahUKEwioiPyV_IPiAhXHxrwKHUeaArUQ6AEwCXoECEoQAQ#v=onepage&q=%22conglomerability%22%20assumption%20math&f=false
Infinity, Causation, and Paradox 著者: Alexander R. Pruss Oxford University Press, 2018
P75
(抜粋)
2.5.3 COUNTABLE ADDITITVITY AND CONGLOMERABILITY
In the setting of classical probability theory, Good's Theorem (Good 1967) guarantees that it never pays for a perfectly rational agent who ha, 110 reason to fear loss of rationality to refuse free information in order to make better decisions.
Our paradoxes, however, do not contradict Good’s Theorem, since classical probability theory assumes countable additivity of probabilities, which is violated by countably infinite fair lotteries.
Indeed, the paradoxes we just discussed are fundamentally due to the lack of countable additivity in the lottery probabilities.
A probability function P is countably additive provided that whenever E1, E2,・・・are disjoint events,
then P(E1 ∨ E2 ∨・・・ ) =P(E1 ) + P(E2)+・・・ Classical mathematical probability theory assumes all probability functions to be countably additive.
But in the countably infinite fair lottery, we do not have countable additivity.

つづく