Probability logic of finitely additive beliefs
type: Item
instance of: scholarly article
title: Probability logic of finitely additive beliefs
zbMATH Open document ID: 1204.03027
author: Chunlai Zhou
published in: Journal of Logic, Language and Information
publication date: 2010-10-06T00:00:00Z
review text: This paper investigates a probability logic \(\Sigma_+\) which resembles certain modal logics. The main focus is on questions related to completeness and compactness. The author enriches propositional logic by adding probabilistic operators \(L_r\) with \(r\in[0,1]\cup \mathbb Q\) to the language. The intended interpretation of \(L_r\varphi\) is that the agents' belief in the event \(\varphi\) is at least \(r.\) As \(\varphi\) is a sentence of this logic, the \(L_r\)-operator possibly occurs multiple times in \(\varphi.\) Next, the notions of finitely additive probability model and finitely additive type space are defined, for which a satisfaction relation \(\models\) is introduced. The author obtains the probability logic \(\Sigma_+\) as the smallest set of formulae that is closed under a set of rules. To prove the truth lemma and Lindenbaum property for \(\Sigma_+\) an auxiliary deducibility relation, \(\Vdash_{\Sigma_+}\) is defined. Using this relation, strong completeness of \(\Sigma_+\) is proved. The brief third section shows how the above results are used to obtain that the axiom system \(\Sigma_H:=\Sigma_+\cup\{L_r\varphi\rightarrow L_1L_r\varphi\}\cup\{\neg L_r\varphi\rightarrow L_1\neg L_r\varphi\}\) is sound and complete with respect to Harsanyi type spaces. Section 4 investigates universal type spaces. The author proves that any canonical finitely additive type space is not universal in the class of finitely additive type spaces. The last section contains a non-compactness theorem for \(\Sigma_+\) and the class of finitely additive type spaces. Hence establishing that probability indices cause the failure of compactness in probability logic.
reviewed by: Jürgen Landes
Mathematics Subject Classification ID: 03B48
zbMATH DE Number: 5796446
zbMATH Keywords: probabilistic beliefs
zbMATH Keywords: type spaces
zbMATH Keywords: reasoning about probabilities
zbMATH Keywords: probabilistic operators
zbMATH Keywords: modal logic
MaRDI profile type: Publication
full work available at URL: s10849-009-9100-2
OpenAlex ID: W2007180327
cites work: Q5386174
cites work: Interactive epistemology. I: Knowledge
cites work: Interactive epistemology. II: Probability
cites work: Modal logic
cites work: Q4094174
cites work: Reasoning about knowledge and probability
cites work: A logic for reasoning about probabilities
cites work: The axioms of subjective probability
cites work: Inferences in probability logic
cites work: Fuzzy logic. Mathematical tools for approximate reasoning
cites work: Q4495853
cites work: Deduction Systems for Coalgebras Over Measurable Spaces
cites work: Q4845472
cites work: Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
cites work: Probability logic for type spaces
cites work: Knowledge spaces with arbitrarily high rank
cites work: Topology-free typology of beliefs
cites work: Coherent beliefs are not always types.
cites work: Measures in Boolean Algebras
cites work: De Finetti, Countable Additivity, Consistency and Coherence
cites work: A More Robust Definition of Subjective Probability
cites work: Finitely additive beliefs and universal type spaces
cites work: An infinitary probability logic for type spaces
cites work: Final coalgebras for functors on measurable spaces
cites work: Some probability logics with new types of probability operators
cites work: Some first-order probability logics
cites work: Logics with the Qualitative Probability Operator
cites work: Quantified beliefs and believed quantities
cites work: Q4403141
cites work: Countable Additivity and Subjective Probability
cites work: Q4781256
cites work: A Complete Deductive System for Probability Logic
DOI: 10.1007/S10849-009-9100-2
description: scientific article; zbMATH DE number 5796446