Type spaces in the sense of Harsanyi (1967/68) can be considered as the probabilistic analog of Kripke structures. By an infinitary propositional language with additional operators "individual i assigns probability at least to" and infinitary inference rules, we axiomatize the class of (Harsanyi) type spaces. We show that our axiom system is strongly sound and strongly complete. To the best of our knowledge, this is the very first strong completeness theorem for a probability logic of the present kind. The result is proved by constructing a canonical type space.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) in its series CORE Discussion Papers with number
2001061.
For technical questions regarding this item, or to correct its listing, contact: (Alain GILLIS).
Related research
Keywords:
Other versions of this item:
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)