Probability Logic for Type Spaces
Using a formal propositional language with operators "individual i assigns probability at least a" for countable many a, we devise an axiom system which is sound and complete with respect to the class of type spaces in the sense of Harsanyi (1967-68). A crucial axiom requires that degrees of belief be compatible for any two sets of assertions which are equivalent in a suitably defined natural sense. The completeness proof relies on a theorem of the alternative from convex analysis, and uses the method of filtration by finite sub-languages.
(This abstract was borrowed from another version of this item.)
If you experience problems downloading a file, check if you have the proper application to view it first. 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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.:
- Dov Samet, 1997. "On the Triviality of High-Order Probabilistic Beliefs," Game Theory and Information 9705001, EconWPA.
- Robert J. Aumann, 1999. "Interactive epistemology II: Probability," International Journal of Game Theory, Springer, vol. 28(3), pages 301-314.
- Dov Samet, 1998.
"Quantified beliefs and believed quantities,"
Game Theory and Information
- MONGINÂ , Philippe, 1993. "A Non-Minimal but Very Weak Axiomatization of Common Belief," CORE Discussion Papers 1993046, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:35:y:2001:i:1-2:p:31-53. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.