Search arXivSearch

arXiv · 1511.03410

The Lascar groups and the 1st homology groups in model theory

Abstract

Let $p$ be a strong type of an algebraically closed tuple over $B=\acl^{\eq}(B)$ in any theory $T$. Depending on a ternary relation $\indo^*$ satisfying some basic axioms (there is at least one such, namely the trivial independence in $T$), the first homology group $H^*_1(p)$ can be introduced, similarly to \cite{GKK1}. We show that there is a canonical surjective homomorphism from the Lascar group over $B$ to $H^*_1(p)$. We also notice that the map factors naturally via a surjection from the `relativised' Lascar group of the type (which we define in analogy with the Lascar group of the theory) onto the homology group, and we give an explicit description of its kernel. Due to this characterization, it follows that the first homology group of $p$ is independent from the choice of $\indo^*$, and can be written simply as $H_1(p)$. As consequences, in any $T$, we show that $|H_1(p)|\geq 2^{\aleph_0}$ unless $H_1(p)$ is trivial, and we give a criterion for the equality of stp and Lstp of algebraically closed tuples using the notions of the first homology group and a relativised Lascar group. We also argue how any abelian connected compact group can appear as the first homology group of the type of a model.

Explore related subjects

Keep this discovery

BibTeXRIS

Jan Dobrowolski, Byunghan Kim, Junguk Lee. 2015-11-11. The Lascar groups and the 1st homology groups in model theory. https://doi.org/10.1016/j.apal.2017.06.006

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