Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-13T21:54:09.661Z Has data issue: false hasContentIssue false

An analytic completeness theorem for logics with probability quantifiers

Published online by Cambridge University Press:  12 March 2014

Douglas N. Hoover*
Affiliation:
Department of Mathematics and Statistics, Queens University, Kingston, Ontario K71 3N6, Canada

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1987

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable