|
This article is cited in 8 scientific papers (total in 8 papers)
Quantification over propositional formulas in probability logic: decidability issues
S. O. Speranskii Novosibirsk State University, Novosibirsk, Russia
Abstract:
A language for reasoning about probability is generalized by adding quantifiers over propositional formulas to the language. Then relevant decidability issues are considered. In particular, the results presented demonstrate that a rather weak fragment of the new language has an undecidable validity problem. On the other hand, it is stated that a restricted version of the validity problem is decidable for $\forall\exists$-sentences.
Keywords:
probability logic, quantification over propositions, decidability.
Received: 26.01.2011 Revised: 29.03.2011
Citation:
S. O. Speranskii, “Quantification over propositional formulas in probability logic: decidability issues”, Algebra Logika, 50:4 (2011), 533–546; Algebra and Logic, 50:4 (2011), 365–374
Linking options:
https://www.mathnet.ru/eng/al500 https://www.mathnet.ru/eng/al/v50/i4/p533
|
|