A note on proba and modal logic.
Prerequisite: knowing a little bit what modal logic is.
OOOOOOOPS I made a minor error in my previous email
The next paragraph is not adequate, I don't need the Lindenbaum bissiness.
So keep: :
Let a finite propositional language L. Let � = the set of all the possible
worlds.
and cancel
, built such that no two worlds denote the same proposition (we get these
worlds that fit with the Lindenbaum algebra, this make everything simpler,
but could be easily generalized).
In fact 2 worlds might differ only by what is believed, not by what is.
Sorry for that distraction....
Philippe
********************************************
Philippe Smets
email: [EMAIL PROTECTED]
IRIDIA-CP 194/6
Universite Libre de Bruxelles
50 av. Roosevelt,
1050 Bruxelles, Belgium.
tel 32 2 650 27 29 secretary,
32 2 344 82 96 private (where I am usually)
fax: 32 2 650 27 15
GSM: 32 495 50 10 72
********************************************
