This paper is a contribution to the study of two distinct kinds of logics for modelling uncertainty. Both approaches use logics with a two-layered modal syntax, but while one employs classical logic on both levels and infinitely-many multimodal operators, the other involves a suitable system of fuzzy logic in the upper layer and only one monadic modality. We take two prominent examples of the former approach, the probability logics Prlin and Prpol (whose modal operators correspond to all possible linear/polynomial inequalities with integer coefficients), and three logics of the latter approach: PrŁ, PrŁ△ and PrPŁ△ (given by the Łukasiewicz logic and its expansions by the Baaz–Monteiro projection connective △ and also by the product conjunction). We describe the relation between the two approaches by giving faithful translations of Prlin and Prpol into, respectively, PrŁ△ and PrPŁ△, and vice versa. We also contribute to the proof theory of two-layered modal logics of uncertainty by introducing a hypersequent calculus HPrŁ for the logic PrŁ . Using this formalism, we obtain a translation of Prlin into the logic PrŁ, seen as a logic on hypersequents of relations, and give an alternative proof of the axiomatization of Prlin.
Classical and fuzzy two-layered modal logics for uncertainty: Translations and proof-theory / P. Baldi, P. Cintula, C. Noguera. - In: INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS. - ISSN 1875-6891. - 13:1(2020 Jul), pp. 988-1001. [10.2991/ijcis.d.200703.001]
Classical and fuzzy two-layered modal logics for uncertainty: Translations and proof-theory
P. Baldi;
2020
Abstract
This paper is a contribution to the study of two distinct kinds of logics for modelling uncertainty. Both approaches use logics with a two-layered modal syntax, but while one employs classical logic on both levels and infinitely-many multimodal operators, the other involves a suitable system of fuzzy logic in the upper layer and only one monadic modality. We take two prominent examples of the former approach, the probability logics Prlin and Prpol (whose modal operators correspond to all possible linear/polynomial inequalities with integer coefficients), and three logics of the latter approach: PrŁ, PrŁ△ and PrPŁ△ (given by the Łukasiewicz logic and its expansions by the Baaz–Monteiro projection connective △ and also by the product conjunction). We describe the relation between the two approaches by giving faithful translations of Prlin and Prpol into, respectively, PrŁ△ and PrPŁ△, and vice versa. We also contribute to the proof theory of two-layered modal logics of uncertainty by introducing a hypersequent calculus HPrŁ for the logic PrŁ . Using this formalism, we obtain a translation of Prlin into the logic PrŁ, seen as a logic on hypersequents of relations, and give an alternative proof of the axiomatization of Prlin.File | Dimensione | Formato | |
---|---|---|---|
IJ-CIS-D-20-00181_I.pdf
accesso aperto
Tipologia:
Publisher's version/PDF
Dimensione
1.97 MB
Formato
Adobe PDF
|
1.97 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.