Related papers: Independence relations in randomizations
Free independence is an important tool for studying the structure of operator algebras. It is natural to ask from the model-theoretic standpoint whether free independence is captured well in first-order model theory via the notion of a…
If T is an model complete theory with the strict order property, then the theory of the models of T with an automorphism has no model companion.
For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…
The notion of probability plays an important role in almost all areas of science and technology. In modern mathematics, however, probability theory means nothing other than measure theory, and the operational characterization of the notion…
An axiomatic treatment of `independence relations' (notions of independence) for complete first-order theories is presented, the principal examples being forking (due to Shelah) and thorn-forking (due to Onshuus). Thorn-forking is…
Statistical independence is a notion ubiquitous in various fields such as in statistics, probability, number theory and physics. We establish the stability of independence for any pair of random variables by their corresponding Brockwell…
A complete first order theory of a relational signature is called monomorphic iff all its models are monomorphic (i.e. have all the $n$-element substructures isomorphic, for each positive integer $n$). We show that a complete theory…
Throughout, $T$ denotes a complete first-order theory in a countable language $L$ that has infinite models and $I(\aleph_0,T)$ denotes the number of countable models of $T$, up to an isomorphism. To determine $I(\aleph_0,T)$, it suffices to…
For two independent, almost surely finite random variables, independence of their minimum (time) and the event that one of them is either greater, equal or less than the other (cause) is completely characterized. It is shown that, other…
A first-order theory $T$ is a model-complete core theory if every first-order formula is equivalent modulo $T$ to an existential positive formula; the core companion of a theory $T$ is a model-complete core theory $S$ such that every model…
We prove that for every simple theory $T$ (or even simple thick compact abstract theory) there is a (unique) compact abstract theory $T^\fP$ whose saturated models are the lovely pairs of $T$. Independence-theoretic results that were proved…
We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…
The concepts of independence and totalness of subspaces are introduced in the context of quasi-probability distributions in phase space, for quantum systems with finite-dimensional Hilbert space. It is shown that due to the…
Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…
A resource theory imposes a preorder over states, with one state being above another if the first can be converted to the second by a free operation, and where the set of free operations defines the notion of resourcefulness under study. In…
We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is…
In this article the idea of random variables over the set theoretic universe is investigated. We explore what it can mean for a random set to have a specific probability of belonging to an antecedently given class of sets.
We present a Lagrangian approach to counting degrees of freedom in first-order field theories. The emphasis is on the systematic attainment of a complete set of constraints. In particular, we provide the first comprehensive procedure to…
Filtered probability spaces (called "filtrations" for short) are shown to satisfy such a topological zero-one law: for every property of filtrations, either the property holds for almost all filtrations, or its negation does. In particular,…
We count the number and patterns of pairs and tuples of independent events in a simple random experiment: first a fair coin is flipped and then a fair die is tossed. The first number, equal to 888,888, suggest that there are some open…