.png){kind=icon}
Return
Conditional p-adic probability logic
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijar.2014.02.001.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
p-Adic
Conditional probability
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3
Papers:
3.0K
Citations:
5.1K
Organization
Cited Papers
Birdcage Coil with Inductively Coupled RF Coil Array for Improving |B₁|-Field Sensitivity In 7-T MRI
PREAI
ShareSaveShareSaveAttitudes toward directly administered antiretroviral therapy (DAART) among HIV-positive inpatients in an inner city public hospital.png)
AIDS Care
AIDS CareIF0
PREAI
ShareSaveMRONJ of the Mandible—From Decortication to a Complex Jaw Reconstruction Using a CAD/CAM-Guided Bilateral Scapula FlapMedicinaOAAI
MedicinaIF0
OAAIShareSave
View more