Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-14T21:01:34.921Z Has data issue: false hasContentIssue false

Quantifier elimination for neocompact sets

Published online by Cambridge University Press:  12 March 2014

H. Jerome Keisler*
Affiliation:
Department of Mathematics, University of Wisconsin, Madison, WI 53706, USA. E-mail: keisler@math.wisc.edu

Abstract

We shall prove quantifier elimination theorems for neocompact formulas, which define neocompact sets and are built from atomic formulas using finite disjunctions, infinite conjunctions, existential quantifiers, and bounded universal quantifiers. The neocompact sets were first introduced to provide an easy alternative to nonstandard methods of proving existence theorems in probability theory, where they behave like compact sets. The quantifier elimination theorems in this paper can be applied in a general setting to show that the family of neocompact sets is countably compact. To provide the necessary setting we introduce the notion of a law structure. This notion was motivated by the probability law of a random variable. However, in this paper we discuss a variety of model theoretic examples of the notion in the light of our quantifier elimination results.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1998

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