We generalise the properties $\mathsf {OP}$, $\mathsf {IP}$, k-$\mathsf {TP}$, $\mathsf {TP}_{1}$, k-$\mathsf {TP}_{2}$, $\mathsf {SOP}_{1}$, $\mathsf {SOP}_{2}$, and $\mathsf {SOP}_{3}$ to positive logic, and prove various implications and equivalences between them. We also provide a characterisation of stability in positive logic in analogy with the one in full first-order logic, both on the level of formulas and on the level of theories. For simple theories there are the classically equivalent definitions of not having $\mathsf {TP}$ and dividing having local character, which we prove to be equivalent in positive logic as well. Finally, we show that a thick theory T has $\mathsf {OP}$ iff it has $\mathsf {IP}$ or $\mathsf {SOP}_{1}$ and that T has $\mathsf {TP}$ iff it has $\mathsf {SOP}_{1}$ or $\mathsf {TP}_{2}$, analogous to the well-known results in full first-order logic where $\mathsf {SOP}_{1}$ is replaced by $\mathsf {SOP}$ in the former and by $\mathsf {TP}_{1}$ in the latter. Our proofs of these final two theorems are new and make use of Kim-independence.

We extend the Burger–Mozes theory of closed, nondiscrete, locally quasiprimitive automorphism groups of locally finite, connected graphs to the semiprimitive case, and develop a generalization of Burger–Mozes universal groups acting on the regular tree $T_{d}$ of degree $d\in \mathbb {N}_{\ge 3}$. Three applications are given. First, we characterize the automorphism types that the quasicentre of a nondiscrete subgroup of $\operatorname {\mathrm {Aut}}(T_{d})$ may feature in terms of the group’s local action. In doing so, we explicitly construct closed, nondiscrete, compactly generated subgroups of $\operatorname {\mathrm {Aut}}(T_{d})$ with nontrivial quasicentre, and see that the Burger–Mozes theory does not extend further to the transitive case. We then characterize the $(P_{k})$-closures of locally transitive subgroups of $\operatorname {\mathrm {Aut}}(T_{d})$ containing an involutive inversion, and thereby partially answer two questions by Banks et al. [‘Simple groups of automorphisms of trees determined by their actions on finite subtrees’, J. Group Theory 18(2) (2015), 235–261]. Finally, we offer a new view on the Weiss conjecture.

In this note, we construct a distal expansion for the structure $$\left( {; + , < ,H} \right)$$, where $H \subseteq $ is a dense $Q$-vector space basis of $R$ (a so-called Hamel basis). Our construction is also an expansion of the dense pair $\left( {; + , < ,} \right)$ and has full quantifier elimination in a natural language.

The derivation on the differential-valued field Tlog of logarithmic transseries induces on its value group ${{\rm{\Gamma }}_{{\rm{log}}}}$ a certain map ψ. The structure ${\rm{\Gamma }} = \left( {{{\rm{\Gamma }}_{{\rm{log}}}},\psi } \right)$ is a divisible asymptotic couple. In [7] we began a study of the first-order theory of $\left( {{{\rm{\Gamma }}_{{\rm{log}}}},\psi } \right)$ where, among other things, we proved that the theory $T_{{\rm{log}}} = Th\left( {{\rm{\Gamma }}_{{\rm{log}}} ,\psi } \right)$ has a universal axiomatization, is model complete and admits elimination of quantifiers (QE) in a natural first-order language. In that paper we posed the question whether Tlog has NIP (i.e., the Non-Independence Property). In this paper, we answer that question in the affirmative: Tlog does have NIP. Our method of proof relies on a complete survey of the 1-types of Tlog, which, in the presence of QE, is equivalent to a characterization of all simple extensions ${\rm{\Gamma }}\left\langle \alpha \right\rangle$ of ${\rm{\Gamma }}$. We also show that Tlog does not have the Steinitz exchange property and we weigh in on the relationship between models of Tlog and the so-called precontraction groups of [9].

We give an example of a pure group that does not have the independence property, whose Fitting subgroup is neither nilpotent nor definable and whose soluble radical is neither soluble nor definable. This answers a question asked by E. Jaligot in May 2013.

We consider a group G that does not have the independence property and study the definability of certain subgroups of G, using parameters from a fixed elementary extension G of G. If X is a definable subset of G, its trace on G is called an externally definable subset. If H is a definable subgroup of G, we call its trace on G an external subgroup. We show the following. For any subset A of G and any external subgroup H of G, the centraliser of A, the A-core of H and the iterated centres of H are external subgroups. The normaliser of H and the iterated centralisers of A are externally definable. A soluble subgroup S of derived length ℓ is contained in an S-invariant externally definable soluble subgroup of G of derived length ℓ. The subgroup S is also contained in an externally definable subgroup X ∩ G of G such that X generates a soluble subgroup of G of derived length ℓ. Analogue results are discussed when G is merely a type definable group in a structure that does not have the independence property.

We give a general construction of sequential games among multiple players, as well as a construction of the composition of sequential games. We obtain new properties of the optimal class of win-by-k games, including closure under composition and independence between the winner of the game and the number of points played. We obtain new results on the asymptotic efficiency of the n-point, win-by-k games.