Sharpening complexity results in quantified probability logic
From MaRDI portal
Cites work
- A logic for reasoning about probabilities
- A note on definability in fragments of arithmetic with free unary predicates
- A Probabilistic Logic with Polynomial Weight Formulas
- An `elementary' perspective on reasoning about probability spaces
- Complexity for probability logic with quantifiers over propositions
- Decidability and expressiveness for first-order logics of probability
- Definability and decision problems in arithmetic
- Elementary induction on abstract structures
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- On the coprimeness relation from the viewpoint of monadic second-order logic
- Presburger arithmetic with unary predicates is Π11 complete
- Probabilistic extensions of various logical systems
- Probability logic
- Probability logics. Probability-based formalization of uncertain reasoning
- Probing the Quantitative-Qualitative Divide in Probabilistic Reasoning
- Quantification over propositional formulas in probability logic: decidability issues
- Quantifying over events in probability logic: an introduction
- Some new results in monadic second-order arithmetic
- Some new results on decidability for elementary algebra and geometry
- Undecidable theories
Cited in
(2)
This page was built for publication: Sharpening complexity results in quantified probability logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6922548)
