Related papers: A New Kim's Lemma
We develop a theory for describing composite objects in physics. These can be static objects, such as tables, or things that happen in spacetime (such as a region of spacetime with fields on it regarded as being composed of smaller such…
In this paper, we axiomatize the negatable consequences in dependence and independence logic by extending the systems of natural deduction of the logics given in (Kontinen and Vaananen 2013) and (Hannula 2015). We prove a characterization…
We develop a theory of formal multivariate polynomials over commutative rings by treating them as ring terms. Our main result is that two ring terms are s-equivalent (when expanded they yield the same standard polynomial) iff they are…
A theory is NIP (resp. stable) if and only if every formula with parameters in two single variables is NIP (resp. does not have the order property).
Let K be an algebraically bounded structure and T be its theory. If T is model complete, then the theory of K endowed with a derivation, denoted by $T^{\delta}$, has a model completion. Additionally, we prove that if the theory T is…
For $n\geq 3$, define $T_n$ to be the theory of the generic $K_n$-free graph, where $K_n$ is the complete graph on $n$ vertices. We prove a graph theoretic characterization of dividing in $T_n$, and use it to show that forking and dividing…
Recent work in NLP shows that LSTM language models capture compositional structure in language data. For a closer look at how these representations are composed hierarchically, we present a novel measure of interdependence between word…
We prove an explicit finite-sample version of the Borel--Cantelli lemma under $m$-dependence. Given any $m$-dependent sequence of events $(A_k)_{1\leq k\leq N}$, we show that \[ \mathbb{P}\Bigl(\bigcup_{k=1}^N A_k\Bigr) \ge 1 -…
We present a new proof of the existence of Morley sequences in simple theories. We avoid using the Erd\H{o}s-Rado theorem and instead use only Ramsey's theorem and compactness. The proof shows that the basic theory of forking in simple…
We show that Csanky's fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LAP from the principle of linear independence. LAP is a natural…
We analyze families of non-autonomous systems of first-order ordinary differential equations admitting a common time-dependent superposition rule, i.e., a time-dependent map expressing any solution of each of these systems in terms of a…
Copulas are essential tools in statistics and probability theory, enabling the study of the dependence structure between random variables independently of their marginal distributions. Among the various types of copulas, Ratio-Type Copulas…
A recent article of Chernikov, Hrushovski, Kruckman, Krupinski, Moconja, Pillay and Ramsey finds the first examples of simple structures with formulas which do not fork over $\emptyset$ but are universally measure zero. In this article we…
Mekler's construction gives an interpretation of any structure in a finite relational language in a group (nilpotent of class $2$ and exponent $p>2$, but not finitely generated in general). Even though this construction is not a…
Structural independence is the (conditional) independence that arises from the structure rather than the precise numerical values of a distribution. We develop this concept and relate it to $d$-separation and structural causal models.…
Usually the 'hidden variables' of Bell's theorem are supposed to describe the pair of Bell particles. Here a semantic shift is proposed, namely to attach the hidden variables to a stochastic medium or field in which the particles move. It…
We refine results of Gannon [G21, Theorem 4.7] and Simon [S15a, Lemma 2.8] on equivalences of convergent Morley sequences. We then introduce the notion of eventual $NIP$, as a property of a model, and give a variant of [KP18, Corollary…
Independence and conditional independence are fundamental concepts for reasoning about groups of random variables in probabilistic programs. Verification methods for independence are still nascent, and existing methods cannot handle…
We prove that, in order to establish that a theory is NSOP$_{1}$, it suffices to show that no formula in a single free variable has SOP$_{1}$.
In this note we develop and clarify some of the basic combinatorial properties of the new notion of $n$-dependence (for $1\leq n < \omega$) recently introduced by Shelah. In the same way as dependence of a theory means its inability to…