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

We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the…

We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…

Let $\pi$ be a set of primes containing $2$ and an odd prime $p$. It is proved that if a finite group $G$ has a Hall $\pi$-subgroup $H$, then the non-$p$-soluble length of $G$ is bounded above by the generalized Fitting height of $H$. The…

The structure of a group which is not nilpotent but all of whose proper subgroups are nilpotent has interested the researches of several authors both in the finite case and in the infinite case. The present paper generalizes some classic…

This paper shows that a Poisson algebra is nilpotent if and only if it is both associative and Lie nilpotent and examines various properties of the nilradical and the solvable radical. It introduces a basic Frattini theory for dialgebras…

We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…

We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…

We study the groups $G$ with the curious property that there exists an element $k\in G$ and a function $f\colon G\to G$ such that $f(xk)=xf(x)$ holds for all $x\in G$. This property arose from the study of near-rings and input-output…

We introduce and study a natural class of fields in which certain first-order definable sets are existentially definable, and characterise this class by a number of equivalent conditions. We show that global fields belong to this class, and…

The notion of bounded FC-nilpotent group is introduced and it is shown that any such group is nilpotent-by-finite, generalizing a result of Neumann on bounded FC-groups.

Two finite groups $L_1$ and $L_2$ are compatible if there exists a finite group $G$ with isomorphic normal subgroups $N_1$ and $N_2$ such that $L_1\cong G/N_1$ and $L_2\cong G/N_2$. We prove a new sufficient condition for two groups to be…

This paper is a continuation of the study on maximal and Frattini L-subgroups of an L-group. The normality of the maximal L-subgroups of a nilpotent L-group is explored. Then, the concept of finitely generated L-subgroup is introduced and…

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

Suppose that a finite group $G$ admits a Frobenius group of automorphisms $FH$ with kernel $F$ and complement $H$ such that the fixed-point subgroup of $F$ is trivial: $C_G(F)=1$. In this situation various properties of $G$ are shown to be…

We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…

Let $\gamma_n=[x_1,\dots,x_n]$ be the $n$th lower central word. Denote by $X_n$ the set of $\gamma_n$-values in a group $G$ and suppose that there is a number $m$ such that $|g^{X_n}|\leq m$ for each $g\in G$. We prove that…

A B-group is a group such that all its minimal generating sets (with respect to inclusion) have the same size. We prove that the class of finite B-groups is closed under taking quotients and that every finite B-group is solvable. Via a…

If V is a finitely generated variety such that the first-order theory of the finite members of V is decidable, we show that V is residually finite, and in fact has a finite bound on the sizes of subdirectly irreducible algebras. This result…

We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…

We study first-order model checking, by which we refer to the problem of deciding whether or not a given first-order sentence is satisfied by a given finite structure. In particular, we aim to understand on which sets of sentences this…