Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Definability in affine continuous logic (2401.07714v2)

Published 15 Jan 2024 in math.LO

Abstract: I study definable sets in affine continuous logic. Let $T$ be an affine theory. After giving some general results, it is proved that if $T$ has a first order model, its extremal theory is a complete first order theory and first order definable sets are affinely definable. In this case, the type spaces of $T$ are Bauer simplices and they coincide with the sets of Keisler measures of the extremal theory. In contrast, if $T$ has a compact model, definable sets are exactly the end-sets of definable predicates. As an example, it is proved in the theory of probability algebras that one dimensional definable sets are exactly the intervals $[a,b]$.

Summary

We haven't generated a summary for this paper yet.