Probability logic for type spaces
AbstractUsing 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.
Download InfoTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Bibliographic InfoPaper provided by THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise in its series THEMA Working Papers with number 98-25.
Date of creation: 1998
Date of revision:
Contact details of provider:
Postal: 33, boulevard du port - 95011 Cergy-Pontoise Cedex
Phone: 33 1 34 25 60 63
Fax: 33 1 34 25 62 33
Web page: http://thema.u-cergy.fr
More information through EDIRC
Other versions of this item:
- Heifetz, A. & Mongin, P., 1998. "Probability Logic for Type Spaces," Papers, Paris X - Nanterre, U.F.R. de Sc. Ec. Gest. Maths Infor. 9825, Paris X - Nanterre, U.F.R. de Sc. Ec. Gest. Maths Infor..
- C49 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Other
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, EconWPA 9705001, EconWPA.
- Dov Samet, 1998.
"Quantified beliefs and believed quantities,"
Game Theory and Information, EconWPA
- MONGIN , Philippe, 1993. "A Non-Minimal but Very Weak Axiomatization of Common Belief," CORE Discussion Papers, UniversitÃ© catholique de Louvain, Center for Operations Research and Econometrics (CORE) 1993046, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Robert J. Aumann, 1999. "Interactive epistemology II: Probability," International Journal of Game Theory, Springer, Springer, vol. 28(3), pages 301-314.
- Pintér, Miklós, 2011.
"Common priors for generalized type spaces,"
44818, University Library of Munich, Germany.
- Philippe Mongin, 2012.
"The doctrinal paradox, the discursive dilemma, and logical aggregation theory,"
Theory and Decision, Springer,
Springer, vol. 73(3), pages 315-355, September.
- Mongin, Philippe, 2012. "The doctrinal paradox, the discursive dilemma, and logical aggregation theory," MPRA Paper 37752, University Library of Munich, Germany.
- Shmuel Zamir, 2008. "Bayesian games: Games with incomplete information," Discussion Paper Series, The Center for the Study of Rationality, Hebrew University, Jerusalem dp486, The Center for the Study of Rationality, Hebrew University, Jerusalem.
- Dietrich, Franz & Mongin Philippe, 2008.
"The Premiss-Based Approach to Judgment Aggregation,"
013, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Dietrich, Franz & Mongin, Philippe, 2010. "The premiss-based approach to judgment aggregation," Journal of Economic Theory, Elsevier, Elsevier, vol. 145(2), pages 562-582, March.
- Franz Dietrich & Philippe Mongin, 2010. "The premiss-based approach to judgment aggregation," LSE Research Online Documents on Economics, London School of Economics and Political Science, LSE Library 27896, London School of Economics and Political Science, LSE Library.
- Mongin, Philippe, 2011. "Judgment aggregation," Les Cahiers de Recherche 942, HEC Paris.
- MEIER, Martin, 2001. "An infinitary probability logic for type spaces," CORE Discussion Papers, UniversitÃ© catholique de Louvain, Center for Operations Research and Econometrics (CORE) 2001061, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Pintér, Miklós & Udvari, Zsolt, 2011. "Generalized type spaces," MPRA Paper 34107, University Library of Munich, Germany.
- Mongin, Philippe & Dietrich, Franz, 2011. "An interpretive account of logical aggregation theory," Les Cahiers de Recherche 941, HEC Paris.
- Pintér, Miklós, 2010. "The non-existence of a universal topological type space," Journal of Mathematical Economics, Elsevier, vol. 46(2), pages 223-229, March.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Marion Oury).
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.