Conditional p-adic probability logic

Abstract

This paper presents the proof-theoretical approach to a p-adic valued conditional probabilistic logic CPLQp. In this logic formulas are built from the finite set of propositional letters. We propose a class of probabilistic models and corresponding infinitary axiomatization for which we prove strong completeness theorem. Decidability of the presented logic is proved.