Article contents
An analytic completeness theorem for logics with probability quantifiers
Published online by Cambridge University Press: 12 March 2014
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1987
Footnotes
This research was supported by an NSERC operating grant. The author is an NSERC University Research Fellow.
We thank H. J. Keisler for pointing out an error in the original statement of the Horn Lemma.
References
REFERENCES
- 3
- Cited by