Superrosy dependent groups having finitely satisfiable generics

Abelian groups definable in $p$-adically closed fields

Recall that a group $G$ has finitely satisfiable generics ($fsg$) or definable $f$-generics ($dfg$) if there is a global type $p$ on $G$ and a small model $M_0$ such that every left translate of $p$ is finitely satisfiable in $M_0$ or definable over $M_0$, respectively. We show that any abelian group definable in a $p$-adically closed field is an extension of a definably compact $fsg$ definable group by a $dfg$ definable group. We discuss an approach which might prove a similar statement for interpretable abelian groups. In the case where $G$ is an abelian group definable in the standard model…

A note on fsg groups in p-adically closed fields

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.

Probabilistically-like nilpotent groups

The main goal of the paper is to present a general model theoretic framework to understand a result of Shalev on probabilistically finite nilpotent groups. We prove that a suitable group where the equation $[x_1,\ldots,x_k]=1$ holds on a wide set, in a model theoretic sense, is an extension of a nilpotent group of class less than $k$ by a uniformly locally finite group. In particular, this result applies to amenable groups, as well as to suitable model-theoretic families of definable groups such as groups in simple theories and groups with finitely satisfiable generics.

NTP₂中的一些NIP-like现象

Some NIP-like phenomena in NTP$_{2}$

本文研究了NTP₂中的NIP-like现象，提出了NTP₂-光滑度量和distality概念，并探讨了有限交替定理及有限可满足性在NTP₂中的扩展问题。

Finitely unstable theories and computational complexity

The complexity class $NP$ can be logically characterized both through existential second order logic $SO\exists$, as proven by Fagin, and through simulating a Turing machine via the satisfiability problem of propositional logic SAT, as proven by Cook. Both theorems involve encoding a Turing machine by a formula in the corresponding logic and stating that a model of this formula exists if and only if the Turing machine halts, i.e. the formula is satisfiable iff the Turing machine accepts its input. Trakhtenbrot's theorem does the same in first order logic $FO$. Such different orders of encoding…

On NIP and invariant measures

We study forking, Lascar strong types, Keisler measures and definable groups, under an assumption of $NIP$ (not the independence property), continuing aspects of math.LO/0607442. Among key results are: (i) if $p = tp(b/A)$ does not fork over $A$ then the Lascar strong type of $b$ over $A$ coincides with the compact strong type of $b$ over $A$ and any global nonforking extension of $p$ is Borel definable over $bdd(A)$ (ii) analogous statements for Keisler measures and definable groups, including the fact that $G^{000} = G^{00}$ for $G$ definably amenable, (iii) definitions, characterizations an…