在Lukasiewicz逻辑和MV-代数中编码de Finetti的相干性
Encoding de Finetti's coherence within Lukasiewicz logic and MV-algebras
摘要:
本文研究了概率逻辑FP(L,L)的证明理论和代数性质,用于Lukasiewicz事件的不确定性推理。从方法论上讲,我们将考虑FP(L,L)的公式到Lukasiewicz逻辑的命题语言之间的转换函数,这使我们能够将后者和MV-代数的成熟理论直接应用于概率推理。更确切地说,利用这样的平移映射,我们将证明FP(L,L)的证明理论性质,并引入一类代数,关于这类代数,FP(L,L)将被证明是局部可靠和完备的。最后,我们将应用这些先前的结果来研究我们所谓的“概率统一问题”。在这方面,我们将证明,吉拉尔迪的代数观点的统一可以扩展到我们的情况下,并与Lukasiewicz命题的情况下,我们表明,概率统一是空的类型。
英文摘要:
The present paper investigates proof-theoretical and algebraic properties for the probability logic FP(L,L), meant for reasoning on the uncertainty of Lukasiewicz events. Methodologically speaking, we will consider a translation function between formulas of FP(L,L) to the propositional language of Lukasiewicz logic that allows us to apply the latter and the well-developed theory of MV-algebras directly to probabilistic reasoning. More precisely, leveraging on such translation map, we will show proof-theoretical properties for FP(L,L) and introduce a class of algebras with respect to which FP(L,L) will be proved to be locally sound and complete. Finally, we will apply these previous results to investigate what we called "probabilistic unification problem". In this respect, we will prove that Ghilardi's algebraic view on unification can be extended to our case and, on par with the Lukasiewicz propositional case, we show that probabilistic unification is of nullary type.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。