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

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

In Team Semantics, a dependency notion is strongly first order if every sentence of the logic obtained by adding the corresponding atoms to First Order Logic is equivalent to some first order sentence. In this work it is shown that all…

The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

We establish vanishing results for the first cohomology group of nilpotent groups and Lie rings when the submodule of invariants is trivial. Our results are obtained within a model-theoretic setting, namely for structures that are definable…

Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…

We study FO+, a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is an FO-definable language that is monotone in monadic predicates but not definable in FO+. This…

We introduce the notions of definable amenability and extreme definable amenability for groups in continuous structures and conduct an extensive analysis of them, drawing parallels with the classical first-order case. We characterize both…

Separability for groups refers to the question which subsets of a group can be detected in its finite quotients. Classically, separability is studied in terms of which classes have a certain separability property, and this question is…

We study FO+, a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is a FO-definable language that is monotone in monadic predicates but not definable in FO+. This provides…

We consider the complexity of deciding membership of a given finite semigroup to a fixed pseudovariety. While it is known that there exist pseudovarieties with NP-complete or even undecidable membership problems, for many well-known…

Supersolubility of a finite group $G=\langle A,B\rangle$ with the nilpotent derived subgroup $G^\prime$ is established under the condition that the subgroups $A$ and $B$ are both subnormal and supersoluble.

Let $G$ be a finite soluble group and $G^{(k)}$ the $k$th term of the derived series of $G$. We prove that $G^{(k)}$ is nilpotent if and only if $|ab|=|a||b|$ for any $\delta_k$-values $a,b\in G$ of coprime orders. In the course of the…

In this paper, the Identity Problem for certain groups, which asks if the subsemigroup generated by a given finite set of elements contains the identity element, is related to problems regarding ordered groups. Notably, the Identity Problem…

Given two languages, a separator is a third language that contains the first one and is disjoint from the second one. We investigate the following decision problem: given two regular input languages of finite words, decide whether there…

William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…

For a group G and an element a in G let |a|_k denote the cardinality of the set of commutators [a,x_1,...,x_k], where x_1,...,x_k range over G. The main result of the paper states that a group G is finite-by-nilpotent if and only if there…

In this paper, we proved that a group $G$ is supersoluble if and only if for any prime $p\in \pi (G)$ there exists a supersoluble subgroup of index $p$.

Suppose that a finite group $G$ admits a Frobenius group of automorphisms FH of coprime order with cyclic kernel F and complement H such that the fixed point subgroup $C_G(H)$ of the complement is nilpotent of class $c$. It is proved that…

We prove that there is a first-order sentence in the language of rings that is true for all finitely generated fields of characteristic 0 and false for all fields of characteristic >0. We also prove that for each n in N, there is a…