We use a generalization of a construction by Ziegler to show that for any field F and any countable collection of countable subsets Ai⊆FAi⊆F, i∈I⊂Z>0i∈I⊂Z>0 there exist infinitely many fields K of arbitrary greater than one transcendence degree over F and of infinite algebraic degree such that each AiAi is first-order definable over K. We also use the construction to show that many infinitely axiomatizable theories of fields which are not compatible with the theory of algebraically closed fields are finitely (...) hereditarily undecidable. (shrink)

An equation to compute the dp-rank of any abelian group is given. It is also shown that its dp-rank, or more generally that of any one-based group, agrees with its Vapnik–Chervonenkis density. Furthermore, strong abelian groups are characterised to be precisely those abelian groups A such that there are only finitely many primes p such that the group A / pA is infinite and for every prime p, there are only finitely many natural numbers n such that $\left[p]/\left[p]$ is infinite.Finally, (...) it is shown that an infinite stable field of finite dp-rank is algebraically closed. (shrink)

We prove that NIP valued fields of positive characteristic are henselian, and we begin to generalize the known results on dp-minimal fields to dp-finite fields. On any unstable dp-finite field K, we define a type-definable group of “infinitesimals,” corresponding to a canonical group topology on (K, +). We reduce the classification of positive characteristic dp-finite fields to the construction of non-trivial Aut(K/A)-invariant valuation rings.

In this article, we develop and clarify some of the basic combinatorial properties of the new notion of n-dependence recently introduced by Shelah. In the same way as dependence of a theory means its inability to encode a bipartite random graph with a definable edge relation, n-dependence corresponds to the inability to encode a random -partite -hypergraph with a definable edge relation. We characterize n-dependence by counting φ-types over finite sets, and in terms of the collapse of random ordered -hypergraph (...) indiscernibles down to order-indiscernibles. (shrink)

A field K in a ring language $\mathcal {L}$ is finitely undecidable if $\mbox {Cons}(T)$ is undecidable for every nonempty finite $T \subseteq {\mathtt{Th}}(K; \mathcal {L})$. We extend a construction of Ziegler and (among other results) use a first-order classification of Anscombe and Jahnke to prove every NIP henselian nontrivially valued field is finitely undecidable. We conclude (assuming the NIP Fields Conjecture) that every NIP field is finitely undecidable. This work is drawn from the author’s PhD thesis [48, Chapter 3].

We initiate the study of definable [Formula: see text]-topologies and show that there is at most one such [Formula: see text]-topology on a [Formula: see text]-henselian NIP field. Equivalently, we show that if [Formula: see text] is a bi-valued NIP field with [Formula: see text] henselian, then [Formula: see text] and [Formula: see text] are comparable. As a consequence, Shelah’s conjecture for NIP fields implies the henselianity conjecture for NIP fields. Furthermore, the latter conjecture is proved for any field admitting (...) a henselian valuation with a dp-minimal residue field. We conclude by showing that Shelah’s conjecture is equivalent to the statement that any NIP field not contained in the algebraic closure of a finite field is [Formula: see text]-henselian. (shrink)

First, an example of a 2-dependent group without a minimal subgroup of bounded index is given. Second, all infinite n-dependent fields are shown to be Artin-Schreier closed. Furthermore, the theory of any non separably closed PAC field has the IPn property for all natural numbers n and certain properties of dependent valued fields extend to the n-dependent context.