English
Related papers

Related papers: Describing groups using first-order language

200 papers

Computations in the cohomology of finite groups.

Algebraic Topology · Mathematics 2007-12-03 Ian J Leary

A group-word $w$ is concise in a class of groups $\mathcal X$ if and only if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G\in \mathcal X$. It is a long-standing open problem whether every…

Group Theory · Mathematics 2024-04-30 Cristina Acciarri , Pavel Shumyatsky

This paper is a contribution to graded model theory, in the context of mathematical fuzzy logic. We study characterizations of classes of graded structures in terms of the syntactic form of their first-order axiomatization. We focus on…

Logic · Mathematics 2019-01-08 Guillermo Badia , Vicent Costa , Pilar Dellunde , Carles Noguera

The purpose of this article is to extend the earliest results of A.A. Brudno, connecting topological entropy of a subshift X over $\mathbb{N}$ to the Kolmogorov complexity of words in X, to subshifts over computable groups that posses…

Dynamical Systems · Mathematics 2015-10-14 Nikita Moriakov

We introduce the calculus of neo-Peircean relations, a string diagrammatic extension of the calculus of binary relations that has the same expressivity as first order logic and comes with a complete axiomatisation. The axioms are obtained…

Logic in Computer Science · Computer Science 2024-01-17 Filippo Bonchi , Alessandro Di Giorgio , Nathan Haydon , Pawel Sobocinski

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

Group Theory · Mathematics 2018-03-15 S. P. Glasby , Cheryl E. Praeger , Kyle Rosa , Gabriel Verret

The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…

Logic · Mathematics 2017-02-23 Matthew Harrison-Trainor

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…

Logic in Computer Science · Computer Science 2015-11-16 Luc Dartois , Charles Paperman

In this note we study a class of finite groups for which the orders of subgroups satisfy a certain inequality. In particular, characterizations of the well-known groups $\mathbb{Z}_2\times\mathbb{Z}_2$ and $S_3$ are obtained.

Group Theory · Mathematics 2016-10-27 Marius Tarnauceanu

We consider (finitary, propositional) logics through the original use of Category Theory: the study of the "sociology of mathematical objects", aligning us with a recent, and growing, trend of study logics through its relations with other…

Category Theory · Mathematics 2016-03-29 Caio de Andrade Mendes , Hugo Luiz Mariano

Commensurable groups are bi-interpretable, under suitable definability conditions.

Group Theory · Mathematics 2023-01-31 Dan Segal

We construct a finitely presented group with undecidable word problem and with Dehn function bounded by a quadratic function on an infinite set of positive integers.

Group Theory · Mathematics 2014-02-26 A. Yu. Olshanskii

In this paper we study the possibility to define irreducible representations of the symmetric groups with the help of finitely many relations. The existence of finite bases is established for the classes of representations corresponding to…

Representation Theory · Mathematics 2007-05-23 Vladimir Shchigolev

In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…

Group Theory · Mathematics 2014-11-25 Jorge Almeida , Stuart Margolis , Benjamin Steinberg , Mikhail Volkov

Inquisitive modal logic, InqML, in its epistemic incarnation, extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. We use the natural notion of…

Logic · Mathematics 2025-02-13 Ivano Ciardelli , Martin Otto

The structure of groups for which certain sets of commutator subgroups are finite is investigated, with a particular focus on the relationship between these groups and those with finite derived subgroup.

Group Theory · Mathematics 2025-07-14 Rosa Cascella

We study complexity of the index set of countably categorical theories and Ehrenfeucht theories in finite languages.

Logic · Mathematics 2011-01-21 A. Ivanov

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…

Group Theory · Mathematics 2014-03-24 Goulnara Arzhantseva , Jean-Francois Lafont , Ashot Minasyan

Definite descriptions are first-order expressions that denote unique objects. In this paper, we propose a second-order counterpart, designed to refer to unique relations between objects. We investigate this notion within the framework of…

Logic in Computer Science · Computer Science 2025-08-20 Yaroslav Petrukhin

We survey the existing parts of a classification of finite groups generated by orthogonal transformations in a finite-dimensional Euclidean space whose fixed point subspace has codimension one or two and extend it to a complete…

Group Theory · Mathematics 2017-11-02 Christian Lange , Marina A. Mikhailova