SearcharxivSearch

arXiv · 1406.7730

Generalized Bohr compactification and model-theoretic connected components

Abstract

For a group $G$ first order definable in a structure $M$, we continue the study of the "definable topological dynamics" of $G$. The special case when all subsets of $G$ are definable in the given structure $M$ is simply the usual topological dynamics of the discrete group $G$; in particular, in this case, the words "externally definable" and "definable" can be removed in the results described below. Here we consider the mutual interactions of three notions or objects: a certain model-theoretic invariant $G^{*}/(G^{*})^{000}_{M}$ of $G$, which appears to be "new" in the classical discrete case and of which we give a direct description in the paper; the [externally definable] generalized Bohr compactification of $G$; [externally definable] strong amenability. Among other things, we essentially prove: (i) The "new" invariant $G^{*}/(G^{*})^{000}_{M}$ lies in between the externally definable generalized Bohr compactification and the definable Bohr compactification, and these all coincide when $G$ is definably strongly amenable and all types in $S_G(M)$ are definable, (ii) the kernel of the surjective homomorphism from $G^*/(G^*)^{000}_M$ to the definable Bohr compactification has naturally the structure of the quotient of a compact (Hausdorff) group by a dense normal subgroup, and (iii) when $Th(M)$ is NIP, then $G$ is [externally] definably amenable iff it is externally definably strongly amenable. In the situation when all types in $S_G(M)$ are definable, one can just work with the definable (instead of externally definable) objects in the above results.

Explore related subjects

Keep this discovery

BibTeXRIS

Krzysztof Krupinski, Anand Pillay. 2014-06-30. Generalized Bohr compactification and model-theoretic connected components. https://arxiv.org/abs/1406.7730

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