Search arXivSearch

arXiv · 1104.0290

On properties of (weakly) small groups

Abstract

A group is small if it has countably many complete $n$-types over the empty set for each natural number n. More generally, a group $G$ is weakly small if it has countably many complete 1-types over every finite subset of G. We show here that in a weakly small group, subgroups which are definable with parameters lying in a finitely generated algebraic closure satisfy the descending chain conditions for their traces in any finitely generated algebraic closure. An infinite weakly small group has an infinite abelian subgroup, which may not be definable. A small nilpotent group is the central product of a definable divisible group with a definable one of bounded exponent. In a group with simple theory, any set of pairwise commuting elements is contained in a definable finite-by-abelian subgroup. First corollary : a weakly small group with simple theory has an infinite definable finite-by-abelian subgoup. Secondly, in a group with simple theory, a normal solvable group A of derived length n is contained in an A-definable almost solvable group of class n.

Explore related subjects

Keep this discovery

BibTeXRIS

Cédric Milliet. 2011-04-02. On properties of (weakly) small groups. https://doi.org/10.2178/jsl/1327068693

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