What is it about?
In this article we describe a bunch of probability logics with quantifiers over events, and develop primary techniques for proving computational complexity results (in terms of m-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.
Featured Image
Read the Original
This page is a summary of: Quantifying over events in probability logic: an introduction, Mathematical Structures in Computer Science, June 2016, Cambridge University Press,
DOI: 10.1017/s0960129516000189.
You can read the full text:
Contributors
The following have contributed to this page