Related papers: Full satisfaction classes, definability, and autom…

We prove that for a stable theory $T,$ if $M$ is a saturated model of $T$ of cardinality $\lambda$ where $\lambda > \big|T\big|,$ then $Aut(M)$ has a dense free subgroup on $2^{\lambda}$ generators. This affirms a conjecture of Hodges.

We find the model completion of the theory modules over $A$, where $A$ is a finitely generated commutative algebra over a field $K$. This is done in a context where the field $K$ and the module are represented by sorts in the theory, so…

We define the completion of an associative algebra $A$ in a set $M=\{M_1,\dots,M_r\}$ of $r$ right $A$-modules in such a way that if $\mathfrak a\subseteq A$ is an ideal in a commutative ring $A$ the completion $A$ in the (right) module…

We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction…

This paper has two parts. In the first one, we prove that an invariant dp-minimal type is either finitely satisfiable or definable. We also prove that a definable version of the (p,q)-theorem holds in dp-minimal theories of small or medium…

We produce a class of $\omega$-categorical structures with finite signature by applying a model-theoretic construction -- a refinement of the Hrushosvki-encoding -- to $\omega$-categorical structures in a possibly infinite signature. We…

Dyer and Formanek (1976) proved that if N is a free nilpotent group of class two and of finite rank which is not equal to 1, or to 3, then the automorphism group Aut(N) of N is complete. The main result of the present paper states that the…

We classify the possible Scott complexities for models of Peano arithmetic. We construct models of particular complexities by first giving a complete Scott analysis of colored linear orderings and constructing models of Peano arithmetic…

There exist two conjectures for constraint satisfaction problems (CSPs) of reducts of finitely bounded homogeneous structures: the first one states that tractability of the CSP of such a structure is, when the structure is a model-complete…

We show that a complete $m$-dimensional immersed submanifold $M$ of $\mathbb{R}^{n}$ with $a(M)<1$ is properly immersed and have finite topology, where $a(M)\in [0,\infty]$ is an scaling invariant number that gives the rate that the norm of…

An automorphism on a complex supermanifold $\mathcal M$ is called unipotent if it reduces to the identity on the associated graded supermanifold $gr(\mathcal M)$. These automorphisms are close to be complementary to those responsible for…

We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a regular set of words, and the interpretation of the…

We characterize the fixed sets of automorphisms of an arbitrary countable, arithmetically saturated structure.

We prove that if a normal subgroup of the extended mapping class group of a closed surface has an element of sufficiently small support then its automorphism group and abstract commensurator group are both isomorphic to the extended mapping…

We apply the recently developed technology of cofinality spectrum problems to prove a range of theorems in model theory. First, we prove that any model of Peano arithmetic is $\lambda$-saturated iff it has cofinality $\geq \lambda$ and the…

For a category $\mathcal E$ with finite limits and well-behaved countable coproducts, we construct a model structure, called the effective model structure, on the category of simplicial objects in $\mathcal E$, generalising the Kan--Quillen…

We use basic tools of descriptive set theory to prove that a closed set $\mathcal S$ of marked groups has $2^{\aleph_0}$ quasi-isometry classes provided every non-empty open subset of $\mathcal S$ contains at least two non-quasi-isometric…

The constraint satisfaction problem (CSP) is a computational problem that includes a range of important problems in computer science. We point out that fundamental concepts of the CSP, such as the solution set of an instance and…

A finite relational structure A is called compact if for any infinite relational structure B of the same type, the existence of a homomorphism from B to A is equivalent to the existence of homomorphisms from all finite substructures of B to…

It is well known that modal satisfiability is PSPACE-complete (Ladner 1977). However, the complexity may decrease if we restrict the set of propositional operators used. Note that there exist an infinite number of propositional operators,…