Completeness theorem for biprobability models (Q3028995)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4016882
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Completeness theorem for biprobability models |
scientific article; zbMATH DE number 4016882 |
Statements
Completeness theorem for biprobability models (English)
0 references
1986
0 references
biprobability model
0 references
admissible set
0 references
probability logic
0 references
probability quantifiers
0 references
completeness theorem
0 references
0.96290815
0 references
0.9298096
0 references
0.91375464
0 references
0.9066421
0 references
0 references
0.8866323
0 references
0.87638956
0 references
A biprobability model is a triple \((M,m_ 1,m_ 2)\) where M is a first- order structure without functions, and \(m_ 1\), \(m_ 2\) are probability measures with \(m_ 1\) absolutely continuous with respect to \(m_ 2\). For any countable admissible set A, the logic \(L_{AP_ 1P_ 2}\) is a variant of the usual probability logic, containing two types of probability quantifiers. These quantifiers are interpreted in the natural way in \((M,m_ 1,m_ 2)\). The author proves a completeness theorem for \(L_{AP_ 1P_ 2}\), thus solving Problem 5.4 in \textit{H. J. Keisler}'s article ``Probability quantifiers'' [Chapter 14 in the book ``Model-theoretic logics'', 509--556 (1986; Zbl 0587.03001)]. The proof uses the Barwise compactness theorem, together with Hoover's variant of the Henkin construction.
0 references