An Analytic Completeness Theorem for Logics with Probability Quantifiers

Hoover, Douglas N.

J. Symbolic Logic, Tome 52 (1987) no. 1, p. 802-816 / Harvested from Project Euclid

Résumé

We give a completeness theorem for a logic with probability quantifiers which is equivalent to the logics described in a recent survey paper of Keisler [K]. This result improves on the completeness theorems in [K] in that it works for languages with function symbols and produces a model whose universe is an analytic subset of the real line, and whose relations and functions are Borel relative to this universe.

Publié le : 1987-09-14
Classification:

@article{1183742445,
     author = {Hoover, Douglas N.},
     title = {An Analytic Completeness Theorem for Logics with Probability Quantifiers},
     journal = {J. Symbolic Logic},
     volume = {52},
     number = {1},
     year = {1987},
     pages = { 802-816},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183742445}
}

Hoover, Douglas N. An Analytic Completeness Theorem for Logics with Probability Quantifiers. J. Symbolic Logic, Tome 52 (1987) no. 1, pp.  802-816. http://gdmltest.u-ga.fr/item/1183742445/