Complexity for probability logic with quantifiers over propositions
From MaRDI portal
Publication:2863169
DOI10.1093/logcom/exs041zbMath1309.03009OpenAlexW2146907658MaRDI QIDQ2863169
Publication date: 21 November 2013
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/exs041
Probability and inductive logic (03B48) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (4)
A note on definability in fragments of arithmetic with free unary predicates ⋮ Collapsing probabilistic hierarchies. I ⋮ Quantifying over events in probability logic: an introduction ⋮ Elementary invariants for quantified probability logic
This page was built for publication: Complexity for probability logic with quantifiers over propositions
