Related papers: Witnessing dp-rank

We consider the partition lattice $\Pi_\kappa$ on any set of transfinite cardinality $\kappa$ and properties of $\Pi_\kappa$ whose analogues do not hold for finite cardinalities. Assuming the Axiom of Choice we prove: (I) the cardinality of…

We give a criterion for an HNN extension of a finite $p$-group to be residually $p$.

In this note we describe instances where values of the $K$-theoretical regulator map evaluated on topological cycles equal entropies of topological actions by a group $\Gamma$. These entropies can also be described by determinants on the…

We show that for a number of theories $T^*$ of model-theoretic interest there is a simpler theory $T$ and $\kappa \ge \aleph_0$ such that $T^*$ is trace equivalent to the theory of $\kappa$-dimensional space over a model of $T$.

Let kappa be an uncountable regular cardinal. Assuming 2^kappa=kappa^+, we show that the clone lattice on a set of size kappa is not dually atomic.

We give a necessary and sufficient condition for the following property of an integer $d\in\mathbb N$ and a pair $(a,A)\in\mathbb R^2$: There exist $\kappa > 0$ and $Q_0\in\mathbb N$ such that for all $\mathbf x\in \mathbb R^d$ and $Q\geq…

We investigate generalizations of the topology of the higher Cantor space on $2^\kappa$, based on arbitrary ideals rather than the bounded ideal on $\kappa$. Our main focus is on the topology induced by the nonstationary ideal, and we call…

We investigate fields of characteristic 0 and dp-rank 2. While we do not obtain a classification, we prove that any unstable field of characteristic 0 and dp-rank 2 admits a unique definable V-topology. If this statement could be…

For a fixed prime p, the p-class tower F(p,infinity,K) of a number field K is considered to be known if a pro-p presentation of the Galois group H = Gal( F(p,infinity,K)/K ) is given. In the last few years, it turned out that the Artin…

We continue our earlier investigation of dp-finite fields. We show that the "heavy sets" of [6] are exactly the sets of full dp-rank. As a consequence, full dp-rank is a definable property in definable families of sets. If $I$ is the group…

The question whether P equals NP revolves around the discrepancy between active production and mere verification by Turing machines. In this paper, we examine the analogous problem for finite transducers and automata. Every nondeterministic…

We introduce a class of notions of forcing which we call $\Sigma$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are $\Sigma$-Prikry. We show that given…

The relationship between the complexity classes P and NP is an unsolved question in the field of theoretical computer science. In this paper, we look at the link between the P - NP question and the "Deterministic" versus "Non Deterministic"…

We provide, for any regular uncountable cardinal $\kappa$, a new argument for Pincus' result on the consistency of $\mathrm{ZF}$ with the higher dependent choice principle $\mathrm{DC}_{<\kappa}$ and the ordering principle in the presence…

In this paper we prove a strong nonstructure theorem for kappa (T)-saturated models of a stable theory T with dop.

We introduce a novel approach to the automated termination analysis of computer programs: we use neural networks to represent ranking functions. Ranking functions map program states to values that are bounded from below and decrease as a…

We investigate the question of whether the restriction of a NIP type $p\in S(B)$ which does not fork over $A\subseteq B$ to $A$ is also NIP, and the analogous question for dp-rank. We show that if $B$ contains a Morley sequence $I$…

We present a type theory combining both linearity and dependency by stratifying typing rules into a level for logics and a level for programs. The distinction between logics and programs decouples their semantics, allowing the type system…

Starting with Zhang's theorem on the infinitude of prime doubles, we give an inductive argument that there exists an infinite number of prime $k$-tuples for at least one admissible set $\mathcal{H}_k=\{h_1,\ldots,h_k\}$ for each $k$.

We investigate the extent of second order characterizable structures by extending Shelah's Main Gap dichotomy to second order logic. For this end we consider a countable complete first order theory T. We show that all sufficiently large…