Related papers: Finite model theory for pseudovarieties and univer…
Feder-Vardi conjecture, which proposed that every finite-domain Constraint Satisfaction Problem (CSP) is either in P or it is NP-complete, has been solved independently by Bulatov and Zhuk almost ten years ago. Bodirsky-Pinsker conjecture…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
We study the automorphism group of the algebraic closure of a substructure A of a pseudo-finite field F. We show that the behavior of this group, even when A is large, depends essentially on the roots of unity in F. For almost all…
Let $\Lambda$ be a finite dimensional algebra over an algebraically closed field. We exhibit slices of the representation theory of $\Lambda$ that are always classifiable in stringent geometric terms. Namely, we prove that, for any…
We consider the preservation of properties of being finitely generated, being finitely presented and being residually finite under direct products in the context of different types of algebraic structures. The structures considered include…
The aim of this article is to obtain variations on the classical theorems of Schur and Baer on finiteness of commutator subgroups, valid in the contexts of Lie algebras and Leibniz algebras over a field. Using non-abelian tensor products…
The finite basis property is often connected with the finite rank property, which it entails. Many examples have been produced of finite rank varieties which are not finitely based. In this note, we establish a result on nilpotent…
A theorem of Eilenberg establishes that there exists a bijection between the set of all varieties of regular languages and the set of all varieties of finite monoids. In this article after defining, for a fixed set of sorts $S$ and a fixed…
First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…
The concept of a C-approximable group, for a class of finite groups C, is a common generalization of the concepts of a sofic, weakly sofic, and linear sofic group. Glebsky raised the question whether all groups are approximable by finite…
Determining when a finite dimensional algebra satisfies the finiteness property known as the $(\textbf{Fg})$-condition is of fundamental importance in the celebrated and influential theory of support varieties. We give an answer to this…
We present a novel approach to the representation theory of finite dimensional algebras motivated by the emerging theory of graph limits. We introduce the rank spectrum of a finite dimensional algebra $R$ over a finite field. The elements…
We show pro-definability of spaces of definable types in various classical complete first order theories, including complete o-minimal theories, Presburger arithmetic, $p$-adically closed fields, real closed and algebraically closed valued…
The purpose of this survey paper is to bring to a large mathematical audience (containing also non-algebraists) some topics of invariant theory both in the classical commutative and the recent noncommutative case. We have included only…
In this dissertation, we present for each natural number $k$, semantic characterizations of the $\exists^k \forall^*$ and $\forall^k \exists^*$ prefix classes of first order logic sentences, over all structures finite and infinite. This…
In this paper it is stressed that there is no {\em physical} reason for symmetries to be linear and that Lie group theory is therefore too restrictive. We illustrate this with some simple examples. Then we give a readable review on the…
It is shown that finite-index extensions and finite-index subgroups of $\omega$-stable groups can be model-theoretically wild. More precisely, there exists an $\omega$-stable group $G$ such that any given countable first-order structure in…
The theory of finite term algebras provides a natural framework to describe the semantics of functional languages. The ability to efficiently reason about term algebras is essential to automate program analysis and verification for…
We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…
We show that the Hrushovski-\fraisse limit of certain classes of trees lead to strictly superstable theories of various U-ranks. In fact, for each $ \alpha\in\omega+1\backslash\{0\} $ we introduce a strictly superstable theory of U-rank $…