Collapsing probabilistic hierarchies. I

DOI10.1007/S10469-013-9230-0MaRDI QIDQ384407zbMATH OpenOpenAlexFDO

Authors S. O. Speranskij

Publication date 27 November 2013

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

Full work available at URL https://doi.org/10.1007/s10469-013-9230-0

zbMATH Keywords

computational complexityexpressivenessprobability logicquantifiers over propositions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Probability and inductive logic (03B48) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models of arithmetic and set theory (03C62)

Recommendations

• Complexity for probability logic with quantifiers over propositions
• Monodic fragments of probabilistic first-order logic
• Hierarchies of probabilistic logics
• Quantification over propositional formulas in probability logic: decidability issues
• Computational hardness of validity in probability logic

Cites work

• A logic for reasoning about probabilities
• An analysis of first-order logics of probability
• Complexity for probability logic with quantifiers over propositions
• Decidability and expressiveness for first-order logics of probability
• Presburger arithmetic with unary predicates is Π₁¹ complete
• Propositional dynamic logic of nonregular programs
• Quantification over propositional formulas in probability logic: decidability issues
• Self-reference and modal logic
• Subsystems of second order arithmetic

Cited in

(3)

• Hierarchies of probabilistic logics
• Quantifying over events in probability logic: an introduction
• Complexity for probability logic with quantifiers over propositions

This page was built for publication: Collapsing probabilistic hierarchies. I

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