Related papers: Existentially Definable Factor Congruences

We resolve the strong Elementary Equivalence versus Isomorphism Problem for finitely generated fields. That is, we show that for every field in this class there is a first-order sentence which characterizes this field within the class up to…

We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…

Let $I$ be a non-empty set and $\mathcal{D}$ an ultrafilter over $I$. For similar algebraic structures $B_i$, $i\in I$ let $\Pi (B_i|i\in I)$ and $\Pi _{\mathcal{D}}(B_i|i\in I)$ denote the direct product and the ultraproduct of $B_i$,…

We provide a family of group measure space II_1 factors for which all finite index subfactors can be explicitly listed. In particular, the set of all indices of irreducible subfactors can be computed. Concrete examples show that this index…

A word $w$ is concise in a class of groups $\mathcal{C}$ if, for every group $G$ in $\mathcal{C}$, the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in $G$. This notion can be naturally extended to…

We show that many important varieties and sets of varieties of semigroups may be defined by relatively simple and transparent first-order formulas in the lattice of all semigroup varieties.

We denote by Conc(A) the semilattice of compact congruences of an algebra A. Given a variety V of algebras, we denote by Conc(V) the class of all semilattices isomorphic to Conc(A) for some A in V. Given varieties V1 and V2 varieties of…

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

We use the rationality of the generalized $h^{th}$ convergent functions, $Conv_h(\alpha, R; z)$, to the infinite J-fraction expansions enumerating the generalized factorial product sequences, $p_n(\alpha, R) =…

We give a combinatorial proof that congruence permutability is prime in the lattice of interpretability types of varieties. Thereby, we settle a 1984 conjecture of Garcia and Taylor.

Given a collection of graphs $\mathbf{G}=(G_1, \ldots, G_m)$ with the same vertex set, an $m$-edge graph $H\subset \cup_{i\in [m]}G_i$ is a transversal if there is a bijection $\phi:E(H)\to [m]$ such that $e\in E(G_{\phi(e)})$ for each…

Let $G$ be a definable group in a $p$-adically closed field $M$. We show that $G$ has finitely satisfiable generics (fsg) if and only if $G$ is definably compact. The case $M = \mathbb{Q}_p$ was previously proved by Onshuus and Pillay.

Suppose given a commutative quadrangle in a Verdier triangulated category such that there exists an induced isomorphism on the horizontally taken cones. Suppose that the endomorphism ring of the initial or the terminal corner object of this…

While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…

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…

A group is called capable if it is a central factor group. For each prime $p$ and positive integer $c$, we prove the existence of a capable $p$-group of class $c$ minimally generated by an element of order $p$ and an element of order…

Polynomial completeness results aim at characterizing those functions that are induced by polynomials. Each polynomial function is congruence preserving, but the opposite need not be true. A finite algebraic structure $\mathbf{A}$ is called…

Let $R$ be a ring and $P$ a prime ideal of $R.$ In this paper, we establish some commutativity criteria for the factor ring $R/P$ in terms of derivations of $R$ satisfying some algebraic identities involving a new kind of involution in…

Let L denote the variety of lattices. In 1982, the second author proved that L is strongly tolerance factorable, that is, the members of L have quotients in L modulo tolerances, although L has proper tolerances. We did not know any other…

We say that a first order formula $\Phi$ defines a graph $G$ if $\Phi$ is true on $G$ and false on every graph $G'$ non-isomorphic with $G$. Let $D(G)$ be the minimal quantifier rank of a such formula. We prove that, if $G$ is a tree of…