Related papers: Definable groups for dependent and 2-dependent the…
We deal with first-order definability in the substructure ordering $(\mathcal{D}; \sqsubseteq)$ of finite directed graphs. In two papers, the author has already investigated the first-order language of the embeddability ordering $(…
Concatenation hierarchies are classifications of regular languages. All such hierarchies are built through the same construction process: start from an initial class of languages and build new levels using two generic operations.…
In this paper, we define indexed type theories which are related to indexed ($\infty$-)categories in the same way as (homotopy) type theories are related to ($\infty$-)categories. We define several standard constructions for such theories…
Let $\mathcal M=(M,<,...)$ be a linearly ordered first-order structure and $T$ its complete theory. We investigate conditions for $T$ that could guarantee that $\mathcal M$ is not much more complex than some colored orders (linear orders…
Let $A$ be a set and $f:A\rightarrow A$ a bijective function. Necessary and sufficient conditions on $f$ are determined which makes it possible to endow $A$ with a binary operation $*$ such that $(A,*)$ is a cyclic group and $f\in…
We give a topological framework for the study of Sela's limit groups: limit groups are limits of free groups in a compact space of marked groups. Many results get a natural interpretation in this setting. The class of limit groups is known…
A definable type of a first-order theory is the same as a section (retraction) of the simplicial path space (decalage) of its space of types viewed as a simplicial topological space; as is well-known, in the category of simplicial sets such…
It is shown that a finite group in which more than 3/4 of the elements are involutions must be an elementary abelian 2-group. A group in which exactly 3/4 of the elements are involutions is characterized as the direct product of the…
Given a $T$-rough definably amenable $T$-rough approximate subgroup $A$ of a group in some first-order structure, there is a type-definable subgroup $H$ normalised by $A$ and contained in $A^4$ of bounded index in $\langle A\rangle$.
In this note we prove and disprove some chain conditions in type definable and definable groups in dependent, strongly dependent and strongly^{2} dependent theories.
Given a group $G$, we write $g^G$ for the conjugacy class of $G$ containing the element $g$. A theorem of B. H. Neumann states that if $G$ is a group in which all conjugacy classes are finite with bounded size, then the commutator subgroup…
This the first of a series of articles dealing with abstract classification theory. The apparatus to assign systems of cardinal invariants to models of a first order theory (or determine its impossibility) is developed in [Sh:a]. It is…
A first-order theory $T$ is a model-complete core theory if every first-order formula is equivalent modulo $T$ to an existential positive formula; the core companion of a theory $T$ is a model-complete core theory $S$ such that every model…
Let $G$ be a finite group and $A$, $B$ and $D$ be conjugacy classes of $ G$ with $D\subseteq AB=\{xy\mid x\in A, y\in B\}$. Denote by $\eta(AB)$ the number of distinct conjugacy classes such that $AB$ is the union of those. Set ${\bf…
We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.
A first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if G is an abelian group, then the follwing are equivalent: 1. Th(G, +) has the…
We continue the study of a class of topological $\mathcal{L}$-fields endowed with a generic derivation $\delta$, focussing on describing definable groups. We show that one can associate to an $\mathcal{L}_{\delta}$ definable group a type…
In dependent type theory, being able to refer to a type universe as a term itself increases its expressive power, but requires mechanisms in place to prevent Girard's paradox from introducing logical inconsistency in the presence of…
We develop in this paper the theory of covers for Hausdorff properly $\bigvee $-definable manifolds with definable choice in an o-minimal structure $\N$. In particular, we show that given an $\N$-definably connected $\N$-definable group $G$…
The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…