Quantifying over events in probability logic: an introduction
Stanislav Olegovich Speranski · Mathematical Structures in Computer Science · 2016
In this article we describe a bunch ofprobability logics with quantifiers over events, and develop primary techniques for proving computational complexity results (in terms ofm-degrees) about these logics, mainly over discrete probability spaces. Also the article contains a comparison with some other probability logics and a discussion of interesting analogies with research in the metamathematics of Boolean algebras, demonstrating a number of attractive features and intuitive advantages of the present proposal.