Related papers: Free Independence is not definable
A dependent theory is a (first order complete theory) T which does not have the independence property. A main result here is: if we expand a model of T by the traces on it of sets definable in a bigger model then we preserve its being…
We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…
This talk is organized as follows: First we explain some basic concepts in non-commutative probability theory in the frame of operator algebras. In Section 2, we discuss related topics in von Neumann algebras. Sections 3 and 4 contain some…
Two objects are independent if they do not affect each other. Independence is well-understood in classical information theory, but less in algorithmic information theory. Working in the framework of algorithmic information theory, the paper…
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 introduce a version of logic for metric structures suitable for applications to C*-algebras and tracial von Neumann algebras. We also prove a purely model-theoretic result to the effect that the theory of a separable metric structure is…
Forking is a central notion of model theory, generalizing linear independence in vector spaces and algebraic independence in fields. We develop the theory of forking in abstract, category-theoretic terms, for reasons both practical (we…
We give a sufficient condition for an algebraic structure to have a computable presentation with a computable basis and a computable presentation with no computable basis. We apply the condition to differentially closed, real closed, and…
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.…
We establish several properties of the free Stein dimension, an invariant for finitely generated unital tracial $*$-algebras. We give formulas for its behaviour under direct sums and tensor products with finite dimensional algebras. Among a…
We seek to create tools for a model-theoretic analysis of types in algebraically closed valued fields (ACVF). We give evidence to show that a notion of 'domination by stable part' plays a key role. In Part A, we develop a general theory of…
We presents an independence relation on sets, one can define dimension by it, assuming that we have an abstract elementary class with a forking notion that satisfies the axioms of a good frame minus stability.
Over a field of characteristic zero, we prove that the Freiheitssatz holds for brace algebras, the word problem for the brace algebras with a single defining relation is decidable, two generated subalgebras of free brace algebras are free,…
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 probability space. We study various notions…
Notions of freedom and independence for hypergraphs of models of a theory are defined. Properties of these notions and their applications to some natural classes of theories are studied.
The rules of d-separation provide a framework for deriving conditional independence facts from model structure. However, this theory only applies to simple directed graphical models. We introduce relational d-separation, a theory for…
The consistency formula for set theory can be stated in terms of the free-variables theory of primitive recursive maps. Free-variable p. r. predicates are decidable by set theory, main result here, built on recursive evaluation of p. r. map…
Let $R$ denote a 2-fir. The notions of F-independence and algebraic subsets of R are defined. The decomposition of an algebraic subset into similarity classes gives a simple way of translating the F-independence in terms of dimension of…
We study the properties of algebraic independence and pointwise algebraic independence in a class of continuous theories, the randomizations $T^R$ of complete first order theories $T$. If algebraic and definable closure coincide in $T$,…
We investigate tensor products of random matrices, and show that independence of entries leads asymptotically to $\varepsilon$-free independence, a mixture of classical and free independence studied by M{\l}otkowski and by Speicher and…