返回
Conditional p-adic probability logic
DOI:10.1016/j.ijar.2014.02.001.png)
摘要
En 中文
In this paper we present the proof-theoretical approach to p-adic valued conditional probabilistic logics. We introduce two such logics denoted by CPLZp and CPLQpfin. Each of these logics extends classical propositional logic with a list of binary (conditional probability) operators. Formulas are interpreted in Kripke-like models that are based on p-adic probability spaces. Axiomatic systems with infinitary rules of inference are given and proved to be sound and strongly complete. The decidability of the satisfiability problem for each logic is proved. (C) 2014 Elsevier Inc. All rights reserved.
Keyword:
p-Adic
Conditional probability
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
引用论文
Birdcage Coil with Inductively Coupled RF Coil Array for Improving |B₁|-Field Sensitivity In 7-T MRI
Attitudes toward directly administered antiretroviral therapy (DAART) among HIV-positive inpatients in an inner city public hospital
AIDS Care
IF0
MRONJ of the Mandible—From Decortication to a Complex Jaw Reconstruction Using a CAD/CAM-Guided Bilateral Scapula Flap
Medicina
IF0

