Related papers: An independence theorem for NTP2 theories
In this paper, the existence and uniqueness of strong solutions to distribution dependent neutral SFDEs are proved. We give the conditions such that the order preservation of these equations holds. Moreover, we show these conditions are…
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
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…
We use the notion of collapse of generalized indiscernible sequences to classify various model theoretic dividing lines. In particular, we use collapse of n-multi-order indiscernibles to characterize op-dimension n; collapse of…
The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…
We study L\"owenheim-Skolem and Omitting Types theorems in Transition Algebra, a logical system obtained by enhancing many sorted first-order logic with features from dynamic logic. The sentences we consider include compositions, unions,…
We develop a notion of forking for Galois-types in the context of Abstract Elementary Classes (AECs). Under the hypotheses that an AEC $K$ is tame, type-short, and failure of an order-property, we consider {\bf Definition.} Let $M_0 \prec…
The class of problems complete for NP via first-order reductions is known to be characterized by existential second-order sentences of a fixed form. All such sentences are built around the so-called generalized IS-form of the sentence that…
We prove that the form of conditional independence at play in database theory and independence logic is reducible to the first-order dividing calculus in the theory of atomless Boolean algebras. This establishes interesting connections…
A set of independence statements may define the independence structure of interest in a family of joint probability distributions. This structure is often captured by a graph that consists of nodes representing the random variables and of…
In the setup of abstract elementary classes satisfying a local version of superstability, we prove the uniqueness property for $\mu$-forking, a certain independence notion arising from splitting. This had been a longstanding technical…
Using an analogy with the rank theorem in differential geometry, it is shown that for a finite $n$-tuple $X$ in a tracial von Neumann algebra and any finite $m$-tuple $F$ of $*$-polynomials in $n$ noncommuting indeterminates,…
Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…
The randomization of a complete first order theory $T$ is the complete continuous theory $T^R$ with two sorts, a sort for random elements of models of $T$, and a sort for events in an underlying atomless probability space. We study…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
Given any two rational numbers $r_1$ and $r_2$, a necessary and sufficient condition is established for the three numbers $1$, $\cos (\pi r_1)$, and $\cos (\pi r_2)$ to be rationally independent. Extending a classical fact sometimes…
Drawing inspiration from Emmy Noether'set-theoretic foundations for algebra and Charles Ehresmann's topology without points, we adopt a new order-theoretic approach to ideal theory. For this we emphasize the order of divisibility in…
We prove in particular that, in a large class of dp-minimal theories including the p-adics, definable types are dense amongst non-forking types.
The independence of the continuum hypothesis is a result of broad impact: it settles a basic question regarding the nature of N and R, two of the most familiar mathematical structures; it introduces the method of forcing that has become the…
We introduce judgemental theories and their calculi as a general framework to present and study deductive systems. As an exemplification of their expressivity, we approach dependent type theory and natural deduction as special kinds of…