Skip to main content Accessibility help

Quantifying over events in probability logic: an introduction



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.



Hide All
Abadi, M. and Halpern, J.Y. (1994). Decidability and expressiveness for first-order logics of probability. Information and Computation 112 (1) 136.
Bernays, P. and Schönfinkel, M. (1928). Zum Entscheidungsproblem der mathematischen Logik. Mathematische Annalen 99 (1) 342372.
Billingsley, P. (1995). Probability and Measure, John Wiley & Sons.
Börger, E., Grädel, E. and Gurevich, Y. (1997). The Classical Decision Problem, Springer.
Fagin, R., Halpern, J.Y. and Megiddo, N. (1990). A logic for reasoning about probabilities. Information and Computation 87 (1–2) 78128.
Hoover, D.N. (1978). Probability logic. Annals of Mathematical Logic 14 (3) 287313.
Keisler, H.J. (1985). Probability quantifiers. In: Barwise, J. and Feferman, S. (eds.) Model-Theoretic Logics, Springer 509556.
Koppelberg, S. (1989). General theory of Boolean algebras. In: Monk, J.D. and Bonnet, R. (eds.) Handbook of Boolean Algebras, vol. 1, North-Holland 1311.
Leitgeb, H. (2013). Reducing belief simpliciter to degrees of belief. Annals of Pure and Applied Logic 164 (12) 13381389.
Leitgeb, H. (2016). Probability in logic. In: Hájek, A. and Hitchcock, C. (eds.) The Oxford Handbook of Probability and Philosophy, Oxford University Press. To appear.
Nies, A. (1996). Undecidable fragments of elementary theories. Algebra Universalis 35 (1) 833.
Paris, J.B. (2011). Pure inductive logic. In: Horsten, L. and Pettigrew, R. (eds.) The Continuum Companion to Philosophical Logic, Continuum 428449.
Rogers, H. (1967). Theory of Recursive Functions and Effective Computability, McGraw-Hill.
Simpson, S.G. (2009). Subsystems of Second Order Arithmetic, Cambridge University Press.
Solovay, R.M., Arthan, R.D. and Harrison, J. (2012). Some new results on decidability for elementary algebra and geometry. Annals of Pure and Applied Logic 163 (12) 17651802.
Speranski, S.O. (2011). Quantification over propositional formulas in probability logic: decidability issues. Algebra and Logic 50 (4) 365374.
Speranski, S.O. (2013a). Complexity for probability logic with quantifiers over propositions. Journal of Logic and Computation 23 (5) 10351055.
Speranski, S.O. (2013b). A note on definability in fragments of arithmetic with free unary predicates. Archive for Mathematical Logic 52 (5–6) 507516.
Speranski, S.O. (2013c). Collapsing probabilistic hierarchies. I, Algebra and Logic 52 (2) 159171.
Suppes, P., de Barros, J.A. and Oas, G. (1998). A collection of probabilistic hidden-variable theorems and counterexamples. In: Pratesi, R. and Ronchi, L. (eds.) Conference Proceedings Vol. 60, Waves, Information and Foundations of Physics, Bologna 267291.
Tarski, A. (1951). A Decision Method for Elementary Algebra and Geometry, University of California Press.
Terwijn, S.A. (2005). Probabilistic logic and induction. Journal of Logic and Computation 15 (4) 507515.

Quantifying over events in probability logic: an introduction



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed