Related papers: First-order recognisability in finite and pseudofi…

We show that any pseudofinite group with NIP theory and with a finite upper bound on the length of chains of centralisers is soluble-by-finite. In particular, any NIP rosy pseudofinite group is soluble-by-finite. This generalises, and…

The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely)…

The first-order theory of the automorphism group of an infinite resplendent model in a finite language is undecidable.

We show that the existence of a first-order formula separating two monadic second order formulas over countable ordinal words is decidable. This extends the work of Henckell and Almeida on finite words, and of Place and Zeitoun on…

In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is…

Given a finite group $G$, we denote by $\nu(G)$ the probability that two randomly chosen elements of $G$ generate a nilpotent subgroup. We prove that if $\nu(G)>1/12,$ then $G$ is solvable.

We say that a class of finite structures for a finite first-order signature is $r$-compressible if each structure $G$ in the class has a first-order description of size at most $O(r(|G|))$. We show that the class of finite simple groups is…

We prove a lifting theorem for odd Frattini covers of finite groups. Using this, we characterize solvable groups and more generally p-solvable groups in terms of containing a triple of elements of distinct prime power orders with product 1.…

This is a survey, intended both for group theorists and model theorists, concerning the structure of pseudofinite groups, that is, infinite models of the first order theory of finite groups. The focus is on concepts from stability theory…

A profinite group is called small if it has only finitely many open subgroups of index n for each positive integer n. We show that every Frattini cover of a small profinite group is small. A profinite group is called strongly complete if…

We study the class of finite groups $G$ satisfying $\Phi (G/N)= \Phi(G)N/N$ for all normal subgroups $N$ of $G$. As a consequence of our main results we extend and amplify a theorem of Doerk concerning this class from the soluble universe…

In this work we continue the syntactic study of completeness that began with the works of Immerman and Medina. In particular, we take a conjecture raised by Medina in his dissertation that says if a conjunction of a second-order and a…

The class of all subdirectly irreducible groups belonging to a variety generated by a finite nilpotent group can be axiomatised by a finite set of elementary sentences.

We prove that for a finitely generated subgroup $H$ of a word-hyperbolic group $G$ the Frattini subgroup $F(H)$ of $H$ is finite.

It is proved that the derived subgroup of a finite group is nilpotent if and only if $|ab|\ge |a||b|$ for all primary commutators $a$ and $b$ of coprime orders.

We give a description of a finite group whose maximal subgroups possess only soluble proper subgroups, which implies the answer to the well-known question on composition factors of finite groups, whose second maximal subgroups are soluble.

We describe the structure of finite groups with $\mathfrak{F}$-subnormal or self-normalizing primary cyclic subgroups when $\mathfrak{F}$ is a subgroup-closed saturate superradical formation containing all nilpotent groups. We prove that…

The class of problems complete for NP via first-order reductions is known to be characterized by existential second-order sentences of a fixed form. All such sentences are built around the so-called generalized IS-form of the sentence that…

We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…

We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is…