Two-layered logics for probabilities and belief functions over Belnap-Dunn logic

Abstrakt

This paper is an extended version of Bílková et al. ((2023b). Logic, Language, Information, and Computation. WoLLIC 2023, Lecture Notes in Computer Science, vol. 13923, Cham, Springer Nature Switzerland, 101-117.). We discuss two-layered logics formalising reasoning with probabilities and belief functions that combine the Łukasiewicz [0, 1]-valued logic with Baaz Δ operator and the Belnap-Dunn logic. We consider two probabilistic logics - PrŁ2Δ (introduced by Bílková et al. 2023d. Annals of Pure and Applied Logic, 103338.) and 4PrŁΔ (from Bílková et al. 2023b. Logic, Language, Information, and Computation. WoLLIC 2023, Lecture Notes in Computer Science, vol. 13923, Cham, Springer Nature Switzerland, 101-117.) - that present two perspectives on the probabilities in the Belnap-Dunn logic. In PrŁ2Δ, every event φ has independent positive and negative measures that denote the likelihoods of φ and -φ, respectively. In 4PrŁΔ, the measures of the events are treated as partitions of the sample into four exhaustive and mutually exclusive parts corresponding to pure belief, pure disbelief, conflict and uncertainty of an agent in φ. In addition to that, we discuss two logics for the paraconsistent reasoning with belief and plausibility functions from Bílková et al. ((2023d). Annals of Pure and Applied Logic, 103338.) - BelŁ2Δ and BelNŁ. Both these logics equip events with two measures (positive and negative) with their main difference being that in BelŁ2Δ, the negative measure of φ is defined as the belief in -φ while in BelNŁ, it is treated independently as the plausibility of -φ.We provide a sound and complete Hilbert-style axiomatisation of 4PrŁΔand establish faithful translations between it and PrŁ2Δ. We also show that the validity problem in all the logics is coNP-complete.