Collapsing probabilistic hierarchies. I

DOI10.1007/S10469-013-9230-0zbMath1315.03033OpenAlexW1975215744MaRDI QIDQ384407

Stanislav O. Speranski

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)

Related Items (1)

Quantifying over events in probability logic: an introduction

Cites Work

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

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