Probability Logic for Type Spaces

A. Heifetz and Philippe Mongin

Working Papers from Paris X - Nanterre, U.F.R. de Sc. Ec. Gest. Maths Infor.

Abstract: 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.

Keywords: PROBABILITY (search for similar items in EconPapers)
JEL-codes: C49 (search for similar items in EconPapers)
Pages: 27 pages
Date: 1998
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
Journal Article: Probability Logic for Type Spaces (2001)
Working Paper: Probability logic for type spaces (1998)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:fth:pnegmi:9825

Access Statistics for this paper

More papers in Working Papers from Paris X - Nanterre, U.F.R. de Sc. Ec. Gest. Maths Infor. THEMA, Universite de Paris X-Nanterre, U.F.R. de science economiques, gestion, mathematiques et informatique, 200, avenue de la Republique 92001 Nanterre CEDEX..
Bibliographic data for series maintained by Thomas Krichel ().