Abstract
We present a class of normal modal calculi PFD, whose syntax is endowed with operators M r (and their dual ones, L r), one for each r ε [0,1]: if a is α sentence, M rα is to he read “the probability that a is true is strictly greater than r” and to he evaluated as true or false in every world of a F-restricted probabilistic kripkean model. Every such a model is a kripkean model, enriched by a family of regular (see below) probability evaluations with range in a fixed finite subset F of [0,1]: there is one such a function for every world w, P F(w,-), and this allows to evaluate M ra as true in the world w iff p F(w, α) 〉 r.
For every fixed F as before, suitable axioms and rules are displayed, so that the resulting system P FD is complete and compact with respect to the class of all the F-restricted probabilistic kripkean models.
Similar content being viewed by others
References
G. S. Boolos, The Unprovability of Consistency: An Essay in Modal Logic, Cambridge University Press, 1978.
C. W. Burrill, Measure, Integration and Probability, McGraw-Hill, 1972.
B. F. Chellas, Modal Logic: An Introduction, Cambridge University Press, 1980.
D. Costantini, Fondamenti del calcolo delle probabilità, Feltrinelli, 1970.
D. Costantini, Introduzione alla probabilità, Boringhieri, 1977.
W. D. Hart, Probability as degree of possibility, Notre-Dame Journal of Formal Logic 13 (1972), pp. 286–288.
P. R. Halmos, Measure Theory, D. van Nostrand Co., 1950.
G. E. Hughes and M. J. Cresswell, An Introduction to Modal Logic, Methuen and Co. Ltd., 1968.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fattorosi-Barnaba, M., Amati, G. Modal operators with probabilistic interpretations, I. Stud Logica 46, 383–393 (1987). https://doi.org/10.1007/BF00370648
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00370648