An Infinitary Probability Logic for Type Spaces

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

Type spaces in the sense of Harsanyi (1967/68) play an important role in the theory of games of incomplete information. They 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 prove 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 with σ-additive probabilities. We show this by constructing a canonical type space whose states consist of all maximal consistent sets of formulas. Furthermore, we show that this canonical space is universal (i.e., a terminal object in the category of type spaces) and beliefs complete.
Original languageEnglish
Pages (from-to)1-58
JournalIsrael Journal of Mathematics
Volume192
Issue number1
DOIs
Publication statusE-pub ahead of print - 12 May 2012

Cite this

An Infinitary Probability Logic for Type Spaces. / Meier, Martin.

In: Israel Journal of Mathematics, Vol. 192, No. 1, 12.05.2012, p. 1-58.

Research output: Contribution to journalArticle

@article{60920edd38594c31a160233e0b5fa0f7,
title = "An Infinitary Probability Logic for Type Spaces",
abstract = "Type spaces in the sense of Harsanyi (1967/68) play an important role in the theory of games of incomplete information. They 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 prove 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 with σ-additive probabilities. We show this by constructing a canonical type space whose states consist of all maximal consistent sets of formulas. Furthermore, we show that this canonical space is universal (i.e., a terminal object in the category of type spaces) and beliefs complete.",
author = "Martin Meier",
year = "2012",
month = "5",
day = "12",
doi = "10.1007/s11856-012-0046-8",
language = "English",
volume = "192",
pages = "1--58",
journal = "Israel Journal of Mathematics",
issn = "0021-2172",
publisher = "Springer New York",
number = "1",

}

TY - JOUR

T1 - An Infinitary Probability Logic for Type Spaces

AU - Meier, Martin

PY - 2012/5/12

Y1 - 2012/5/12

N2 - Type spaces in the sense of Harsanyi (1967/68) play an important role in the theory of games of incomplete information. They 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 prove 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 with σ-additive probabilities. We show this by constructing a canonical type space whose states consist of all maximal consistent sets of formulas. Furthermore, we show that this canonical space is universal (i.e., a terminal object in the category of type spaces) and beliefs complete.

AB - Type spaces in the sense of Harsanyi (1967/68) play an important role in the theory of games of incomplete information. They 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 prove 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 with σ-additive probabilities. We show this by constructing a canonical type space whose states consist of all maximal consistent sets of formulas. Furthermore, we show that this canonical space is universal (i.e., a terminal object in the category of type spaces) and beliefs complete.

U2 - 10.1007/s11856-012-0046-8

DO - 10.1007/s11856-012-0046-8

M3 - Article

VL - 192

SP - 1

EP - 58

JO - Israel Journal of Mathematics

JF - Israel Journal of Mathematics

SN - 0021-2172

IS - 1

ER -