Probability Logic of Finitely Additive Beliefs

Probability logics have been an active topic of investigation of beliefs in type spaces in game theoretical economics. Beliefs are expressed as subjective probability measures. Savage's postulates in decision theory imply that subjective probability measures are not necessarily countably additi...

Full description

Saved in:
Bibliographic Details
Published in:Journal of logic, language, and information language, and information, 2010-07, Vol.19 (3), p.247-282
Main Author: Zhou, Chunlai
Format: Article
Language:English
Subjects:
Algebra
Deductive reasoning
Education
Game theory
Information Systems Applications (incl.Internet)
Linear inequalities
Logic
Logical theorems
Modal logic
Morphisms
Philosophy
Probabilities
Probability logic
Semantics
Syntax
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Probability logics have been an active topic of investigation of beliefs in type spaces in game theoretical economics. Beliefs are expressed as subjective probability measures. Savage's postulates in decision theory imply that subjective probability measures are not necessarily countably additive but finitely additive. In this paper, we formulate a probability logic Σ₊ that is strongly complete with respect to this class of type spaces with finitely additive probability measures, i.e. a set of formulas is consistent in Σ₊ iff it is satisfied in a finitely additive type space. Although we can characterize Σ₊ -theories satisfiable in the class as maximally consistent sets of formulas, we prove that any canonical model of maximally consistent sets is not universal in the class of type spaces with finitely additive measures, and, moreover, it is not a type space. At the end of this paper, we show that even a minimal use of probability indices causes the failure of compactness in probability logics.
ISSN:0925-8531
1572-9583
DOI:10.1007/s10849-009-9100-2