Continuous Craig Interpolation
We prove analogues of the Craig interpolation theorem for the continuous model theory of metric structures.
math.LO↗
arXiv subjects
H. Jerome Keisler
Publications and source records attributed to H. Jerome Keisler.
Using Ultrapowers to Compare Continuous Structures
In 1967 the author introduced a pre-ordering of all first order complete theories where T is lower than U if it is easier for an ultrapower of a model of T than an ultrapower of a model of U to be saturated. In a long series of recent papers, Malliaris and Shelah showed that this pre-ordering is very rich and gives a useful way of classifying simple theories. In this paper we investigate the analogous pre-ordering in continuous model theory.
math.LO↗
Model Theory for Real-valued Structures
We consider general structures where formulas have truth values in the real unit interval as in continuous model theory, but whose predicates and functions need not be uniformly continuous with respect to a distance predicate. Every general structure can be expanded to a pre-metric structure by adding a distance predicate that is a uniform limit of formulas. Moreover, that distance predicate is unique up to uniform equivalence. We use this to extend the central notions in the model theory of metric structures to general structures, and show that many model-theoretic results from the literature about metric structures have natural analogues for general structures.
math.LO↗
Continuous Sentences Preserved Under Reduced Products
Answering a question of Cifú Lopes, we give a syntactic characterization of those continuous sentences that are preserved under reduced products of metric structures. In fact, we settle this question in the wider context of general structures as introduced by the second author.
math.LO↗
Independence in randomizations
The randomization of a complete first order theory $T$ is the complete continuous theory $T^R$ with two sorts, a sort for random elements of models of $T$, and a sort for events in an underlying atomless probability space. We study independence relations and related ternary relations on the randomization of $T$. We show that if $T$ has the exchange property and $\operatorname{acl}=\operatorname{dcl}$, then $T^R$ has a strict independence relation in the home sort, and hence is real rosy. In particular, if $T$ is o-minimal, then $T^R$ is real rosy.
math.LO↗
A Canonical Hidden-Variable Space
The hidden-variable question is whether or not various properties --- randomness or correlation, for example --- that are observed in the outcomes of an experiment can be explained via introduction of extra (hidden) variables which are unobserved by the experimenter. The question can be asked in both the classical and quantum domains. In the latter, it is fundamental to the interpretation of the quantum formalism (Bell [1964], Kochen and Specker [1967], and others). In building a suitable mathematical model of an experiment, the physical set-up will guide us on how to model the observable variables --- i.e., the measurement and outcome spaces. But, by definition, we cannot know what structure to put on the hidden-variable space. Nevertheless, we show that, under a measure-theoretic condition, the hidden-variable question can be put into a canonical form. The condition is that the $σ$-algebras on the measurement and outcome spaces are countably generated. An argument using a classical result on isomorphisms of measure algebras then shows that the hidden-variable space can always be taken to be the unit interval equipped with the Lebesgue measure on the Borel sets.
quant-ph↗
Scattered Sentences have Few Separable Randomizations
In the paper "Randomizations of Scattered Sentences", Keisler showed that if Martin's axiom for aleph one holds, then every scattered sentence has few separable randomizations, and asked whether the conclusion could be proved in ZFC alone. We show here that the answer is "yes". It follows that the absolute Vaught conjecture holds if and only if every $L_{ω_1ω}$-sentence with few separable randomizations has countably many countable models.
math.LO↗
Algebraic Independence Relations in Randomizations
We study the properties of algebraic independence and pointwise algebraic independence in a class of continuous theories, the randomizations $T^R$ of complete first order theories $T$. If algebraic and definable closure coincide in $T$, then algebraic independence in $T^R$ satisfies extension and has local character with the smallest possible bound, but has neither finite character nor base monotonicity. For arbitrary $T$, pointwise algebraic independence in $T^R$ satisfies extension for countable sets, has finite character, has local character with the smallest possible bound, and satisfies base monotonicity if and only if algebraic independence in $T$ does.
math.LO↗
Independence relations in randomizations
The randomization of a complete first order theory $T$ is the complete continuous theory $T^R$ with two sorts, a sort for random elements of models of $T$, and a sort for events in an underlying probability space. We study various notions of independence in models of $T^R$.
math.LO↗
Fiber Products of Measures and Quantum Foundations
With a view to quantum foundations, we define the concepts of an empirical model (a probabilistic model describing measurements and outcomes), a hidden-variable model (an empirical model augmented by unobserved variables), and various properties of hidden-variable models, for the case of infinite measurement spaces and finite outcome spaces. Thus, our framework is general enough to include, for example, quantum experiments that involve spin measurements at arbitrary relative angles. Within this framework, we use the concept of the fiber product of measures to prove general versions of two determinization results about hidden-variable models. Specifically, we prove that: (i) every empirical model can be realized by a deterministic hidden-variable model; (ii) for every hidden-variable model satisfying locality and lambda-independence, there is a realization-equivalent hidden-variable model satisfying determinism and lambda-independence.
quant-ph↗
Definable closure in randomizations
The randomization of a complete first order theory T is the complete continuous theory T^R with two sorts, a sort for random elements of models of T, and a sort for events in an underlying probability space. We give necessary and sufficient conditions for an element to be definable over a set of parameters in a model of T^R.
math.LO↗
Randomizations of models as metric structures
The notion of a randomization of a first order structure was introduced by Keisler in the paper Randomizing a Model, Advances in Math. 1999. The idea was to form a new structure whose elements are random elements of the original first order structure. In this paper we treat randomizations as continuous structures in the sense of Ben Yaacov and Usvyatsov. In this setting, the earlier results show that the randomization of a complete first order theory is a complete theory in continuous logic that admits elimination of quantifiers and has a natural set of axioms. We show that the randomization operation preserves the properties of being omega-categorical, omega-stable, and stable.
math.LO↗