Publisher： Cambridge University Press
E-ISSN： 1943-5886|52|3|802-816
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.52, Iss.3, 1987-09, pp. : 802-816
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
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.
Related content
A completeness theorem for higher order logics
The Journal of Symbolic Logic, Vol. 65, Iss. 2, 2000-06 ,pp. :
Access to resources
Recommend
A unified completeness theorem for quantified modal logics
The Journal of Symbolic Logic, Vol. 67, Iss. 4, 2002-12 ,pp. :
The hierarchy theorem for generalized quantifiers
The Journal of Symbolic Logic, Vol. 61, Iss. 3, 1996-09 ,pp. :
Local Completeness and Drop Theorem
By Qiu J-H.
Journal of Mathematical Analysis and Applications, Vol. 266, Iss. 2, 2002-02 ,pp. :
The completeness theorem for infinitary logic
The Journal of Symbolic Logic, Vol. 37, Iss. 1, 1972-03 ,pp. :