SearcharxivSearch

arXiv · 1911.01129

Definability patterns and their symmetries

Abstract

We identify a canonical structure J associated to any first-order theory, the {\it space of definability patterns}. It generalizes the imaginary algebraic closure in a stable theory, and the hyperimaginary bounded closure in simple theories. J admits a compact topology, not necessarily Hausdorff, but the Hausdorff part can already be bigger than the Kim-Pillay space. Using it, we obtain simple proofs of a number of results previously obtained using topological dynamics, but working one power set level lower. The Lascar neighbour relation is represented by a canonical relation on the compact Hausdorff part J; the general Lascar group can be read off this compact structure. This gives concrete form to results of Krupi\'nski, Newelski, Pillay, Rzepecki and Simon, who used topological dynamics applied to large models to show the existence of compact groups mapping onto the Lascar group. In an appendix, we show that a construction analogous to the above but using infinitary patterns recovers the Ellis group of \cite{kns}, and use this to sharpen the cardinality bound for their Ellis group from $\beth_5$ to $\beth_3$, showing the latter is optimal. There is also a close connection to another school of topological dynamics, set theory and model theory, centered around the Kechris-Pestov-Todor\v cevi\'c correspondence. We define the Ramsey property for a first order theory, and show - as a simple application of the construction applied to an auxiliary theory - that any theory admits a canonical minimal Ramsey expansion. This was envisaged and proved for certain Fraiss\'e classes, first by Kechris-Pestov-Todor\v cevi\'c for expansions by orderings, then by Melleray, Nguyen Van Th\'e, Tsankov and Zucker for more general expansions.

Explore related subjects

Keep this discovery

BibTeXRIS

Ehud Hrushovski. 2019-11-04. Definability patterns and their symmetries. https://arxiv.org/abs/1911.01129

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO