Quantifying over events in probability logic: an introduction

DOI10.1017/S0960129516000189zbMath1456.03046OpenAlexW2467999470MaRDI QIDQ4593244

Stanislav O. Speranski

Publication date: 22 November 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129516000189

Mathematics Subject Classification ID

Probability and inductive logic (03B48)

Related Items (2)

Elementary invariants for quantified probability logic ⋮ IS CAUSAL REASONING HARDER THAN PROBABILISTIC REASONING?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on definability in fragments of arithmetic with free unary predicates
• Collapsing probabilistic hierarchies. I
• Reducing belief simpliciter to degrees of belief
• Quantification over propositional formulas in probability logic: decidability issues
• Some new results on decidability for elementary algebra and geometry
• Decidability and expressiveness for first-order logics of probability
• A logic for reasoning about probabilities
• Undecidable fragments of elementary theories
• The Oxford Handbook of Probability and Philosophy
• Complexity for probability logic with quantifiers over propositions
• Probability logic
• Probabilistic Logic and Induction

This page was built for publication: Quantifying over events in probability logic: an introduction