QUANTIFICATION OVER PROPOSITIONAL FORMULAS IN PROBABILITY LOGIC: DECIDABILITY ISSUES

被引:5
|
作者
Speranskii, S. O. [1 ]
机构
[1] Novosibirsk State Univ, Novosibirsk 630090, Russia
关键词
probability logic; quantification over propositions; decidability;
D O I
10.1007/s10469-011-9148-3
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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 for all there exists-sentences.
引用
收藏
页码:365 / 374
页数:10
相关论文
共 50 条