Related papers: Towards a pseudoequational proof theory

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

We show that the pointlike and the idempotent pointlike problems are reducible with respect to natural signatures in the following cases: the pseudovariety of all finite semigroups in which the order of every subgroup is a product of…

We investigate whether the group algebra of a finite group over a localisation of the integers is semiperfect. The main result is a necessary and sufficient arithmetic criterion in the ordinary case. In the modular case, we propose a…

For each of the following conditions, we characterize the pseudovarieties of semigroups V that satisfy it: (i) every epimorphism to a member of V is onto; (ii) every epimorphism to a finite semigroup with domain a member of V is onto; (iii)…

Classes of algebraic structures that are defined by equational laws are called varieties or equational classes. A variety is finitely generated if it is defined by the laws that hold in some fixed finite algebra. We show that every…

In this paper we exhibit a type of semigroup presentations which determines a class of local groups. We show that the finite elements of this class generate the pseudovariety ${\bf LG}$ of all finite local groups and use them as…

In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…

Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…

We consider implicit signatures over finite semigroups determined by sets of pseudonatural numbers. We prove that, under relatively simple hypotheses on a pseudovariety V of semigroups, the finitely generated free algebra for the largest…

We show that pseudovarieties of finitely generated algebras, i.e., classes $C$ of finitely generated algebras closed under finite products, homomorphic images, and subalgebras, can be described via a uniform structure $U$ on the free…

We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…

For all sufficiently large odd integers $n$, the following version of Higman's embedding theorem is proved in the variety ${\cal B}_n$ of all groups satisfying the identity $x^n=1$. A finitely generated group $G$ from ${\cal B}_n$ has a…

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)…

A permutoid is a set of partial permutations that contains the identity and is such that partial compositions, when defined, have at most one extension in the set. In 2004 Peter Cameron conjectured that there can exist no algorithm that…

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…

For an arbitrary finite dimensional algebra $\Lambda$, we prove that any wide subcategory of $\mathsf{mod} \Lambda$ satisfying a certain finiteness condition is $\theta$-semistable for some stability condition $\theta$. More generally, we…

This paper is a contribution to the theory of finite semigroups and their classification in pseudovarieties, which is motivated by its connections with computer science. The question addressed is what role can play the consideration of an…

We develop local NIP group theory in the context of pseudofinite groups. In particular, given a sufficiently saturated pseudofinite structure $G$ expanding a group, and left invariant NIP formula $\delta(x;\bar{y})$, we prove various…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$ and let $G$ be a finite group. Then $G$ is said to be $\sigma $-full if $G$ has a Hall $\sigma _{i}$-subgroup for all $i$. A subgroup $A$ of $G$ is…

The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable when the model-complete core of the template…