SearcharxivSearch

arXiv · 1510.00340

Topological dynamics and the complexity of strong types

Abstract

We develop topological dynamics for the group of automorphisms of a monster model of any given theory. In particular, we find strong relationships between objects from topological dynamics (such as the generalized Bohr compactification introduced by Glasner) and various Galois groups of the theory in question, obtaining essentially new information about them, e.g. we present the closure of the identity in the Lascar Galois group of the theory as the quotient of a compact, Hausdorff group by a dense subgroup. We apply this to describe the complexity of bounded, invariant equivalence relations, obtaining comprehensive results, subsuming and extending the existing results and answering some open questions from earlier papers. We show that, in a countable theory, any such relation restricted to the set of realizations of a complete type over $\emptyset$ is type-definable if and only if it is smooth. Then we show a counterpart of this result for theories in an arbitrary (not necessarily countable) language, obtaining also new information involving relative definability of the relation in question. As a final conclusion we get the following trichotomy. Let $\mathfrak{C}$ be a monster model of a countable theory, $p \in S(\emptyset)$, and $E$ be a bounded, (invariant) Borel (or, more generally, analytic) equivalence relation on $p(\mathfrak{C})$. Then, exactly one of the following holds: (1) $E$ is relatively definable (on $p(\mathfrak{C})$), smooth, and has finitely many classes, (2) $E$ is not relatively definable, but it is type-definable, smooth, and has $2^{\aleph_0}$ classes, (3) $E$ is not type definable and not smooth, and has $2^{\aleph_0}$ classes. All the results which we obtain for bounded, invariant equivalence relations carry over to the case of bounded index, invariant subgroups of definable groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Krzysztof Krupiński, Anand Pillay, Tomasz Rzepecki. 2015-10-01. Topological dynamics and the complexity of strong types. https://doi.org/10.1007/s11856-018-1780-3

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