Abstract | ||
---|---|---|
We study the model-theoretic aspects of a probability logic suited for talking about measure spaces. This nonclassical logic has a model theory rather different from that of classical predicate logic. In general, not every satisfiable set of sentences has a countable model, but we show that one can always build a model on the unit interval. Also, the probability logic under consideration is not compact. However, using ultraproducts we can prove a compactness theorem for a certain class of weak models. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1017/S1755020313000063 | REVIEW OF SYMBOLIC LOGIC |
DocType | Volume | Issue |
Journal | 6 | 3 |
ISSN | Citations | PageRank |
1755-0203 | 0 | 0.34 |
References | Authors | |
8 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Rutger Kuyper | 1 | 6 | 3.72 |
Sebastiaan A. Terwijn | 2 | 186 | 21.06 |