Related papers: Forking in NTP_2 theories
We present a framework for studying the concept of independence in a general context covering database theory, algebra and model theory as special cases. We show that well-known axioms and rules of independence for making inferences…
We prove that, in the random stirring model of parameter T on an infinite rooted tree each of whose vertices has at least two offspring, infinite cycles exist almost surely, provided that T is sufficiently high. In the appendices, the bound…
We provide a uniform upper bound on the minimal drift so that the one-per-site frog model on a $d$-ary tree is recurrent. To do this, we introduce a subprocess that couples across trees with different degrees. Finding couplings for frog…
Empirical process theory for i.i.d. observations has emerged as a ubiquitous tool for understanding the generalization properties of various statistical problems. However, in many applications where the data exhibit temporal dependencies…
We demonstrate that theories $\text{Z}^-$, $\text{ZF}^-$, $\text{ZFC}^-$ (minus means the absence of the Power Set axiom) and $\text{PA}_2$, $\text{PA}_2^-$ (minus means the absence of the Countable Choice schema) are equiconsistent to each…
We construct an addition and a multiplication on the set of planar binary trees, closely related to addition and multiplication on the integers. This gives rise to a new kind of (noncommutative) arithmetic theory. The price to pay for this…
Dividing asks about inconsistency along indiscernible sequences. In order to study the finer structure of simple theories without much dividing, the authors recently introduced shearing, which essentially asks about inconsistency along…
We study the conservativity of extensions by additional strict equalities of dependent type theories (and more general second-order generalized algebraic theories). The conservativity of Extensional Type Theory over Intensional Type Theory…
We investigate the structure of FN bases (Frechet-Nikodym bases) without assuming the Continuum Hypothesis (CH), refining results of Siu-Ah Ng concerning definability via flatness and nonforking. In particular, we examine the dependence of…
We show that for $\Pi_2$-properties of second or third order arithmetic as formalized in appropriate natural signatures the apparently weaker notion of forcibility overlaps with the standard notion of consistency (assuming large cardinal…
In this note, we investigate a new model theoretical tree property, called the antichain tree property (ATP). We develop combinatorial techniques for ATP. First, we show that ATP is always witnessed by a formula in a single free variable,…
It is shown that if the Fourier transform is a bounded map on a rearrangement-invariant space of functions on $\mathbb R^n$, modified by a weight, then the weight is bounded above and below and the space is equivalent to $L^2$. Also, if it…
A theorem of Albert-Draxl states that if a tensor product of two quaternion division algebras $Q_1$, $Q_2$ over a field $F$ is not a division algebra, then there exists a separable quadratic extension of $F$ that embeds as a subfield in…
This thesis concerns embeddings and self-embeddings of foundational structures in both set theory and category theory. The first part of the work on models of set theory consists in establishing a refined version of Friedman's theorem on…
This paper presents and discusses several methods for reasoning from inconsistent knowledge bases. A so-called argumentative-consequence relation taking into account the existence of consistent arguments in favor of a conclusion and the…
We show that variants of the classical reflection functors from quiver representation theory exist in any abstract stable homotopy theory, making them available for example over arbitrary ground rings, for quasi-coherent modules on schemes,…
We prove that in NTP_2 theories if p is a dependent type with dp-rank >= \kappa, then this can be witnessed by indiscernible sequences of tuples satisfying p. If p has dp-rank infinity, then this can be witnessed by singletons (in any…
We give a definition of topological entropy for tree shifts, prove that the limit in the definition exists, and show that it dominates the topological entropy of the associated one-dimensional shift of finite type when the labeling of the…
We present a soundness theorem for a dependent type theory with context constants with respect to an indexed category of (finite, abstract) simplical complexes. The point of interest for computer science is that this category can be seen to…
We characterize nonforking (Morley) sequences in dependent theories in terms of a generalization of Poizat's special sequences and show that average types of Morley sequences are stationary over their domains. We characterize generically…