Quantification over propositional formulas in probability logic: decidability issues

DOI10.1007/S10469-011-9148-3MaRDI QIDQ695788zbMATH OpenOpenAlexFDO

Authors S. O. Speranskij

Publication date 17 December 2012

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10469-011-9148-3

zbMATH Keywords

decidabilityprobability logicquantification over propositions

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Probability and inductive logic (03B48)

Recommendations

• Complexity for probability logic with quantifiers over propositions
• Decidability and expressiveness for first-order logics of probability
• A logic for reasoning about probabilities
• Decidability and Undecidability in Probability Logic
• A Logic of Probability with Decidable Model Checking

Cites work

• A logic for reasoning about probabilities
• scientific article; zbMATH DE number 2046116 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)

Cited in

(9)

• Decidability and expressiveness for first-order logics of probability
• Complexity for probability logic with quantifiers over propositions
• Decidability and Undecidability in Probability Logic
• Collapsing probabilistic hierarchies. I
• Quantifying over events in probability logic: an introduction
• Elementary invariants for quantified probability logic
• Infinitary calculus for first-order logic of probability with distribution on the domain
• Sharpening complexity results in quantified probability logic
• On the decision problem for quantified probability logics

This page was built for publication: Quantification over propositional formulas in probability logic: decidability issues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q695788)