Related papers: Free Independence is not definable
In this paper, we study the notion of a separability idempotent in the C*-algebra framework. This is analogous to the notion in the purely algebraic setting, typically considered in the case of (finite-dimensional) algebras with identity,…
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…
A model companion is shown to exist for the theory of partial differential fields of characteristic zero equipped with free operators that commute with the derivations. The free operators here are those introduced in [R. Moosa and T.…
We prove that the automorphisms of any separable C*-algebra that does not have continuous trace are not classifiable by countable structures up to unitary equivalence. This implies a dichotomy for the Borel complexity of the relation of…
For an associative algebra $A$ with a simple module $M$ with trivial endomorphisms and trivial annihilator we verify the countable separation property (CSP), i.e. we prove that there exists a list of nonzero elements $a_1, a_2,\ldots$ of…
Consider a diagram $\cdots \to F_3 \to F_2\to F_1$ of algebraic systems, where $F_n$ denotes the free object on $n$ generators and the connecting maps send the extra generator to some distinguished trivial element. We prove that (a) if the…
We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…
We extend the theory of d-separation to cases in which data instances are not independent and identically distributed. We show that applying the rules of d-separation directly to the structure of probabilistic models of relational data…
We study first-order model checking, by which we refer to the problem of deciding whether or not a given first-order sentence is satisfied by a given finite structure. In particular, we aim to understand on which sets of sentences this…
The set of natural integers is fundamental for at least two reasons: it is the free induction algebra over the empty set (and at such allows definitions of maps by primitive recursion) and it is the free monoid over a one-element set, the…
The notion of a $*$-law or $*$-distribution in free probability is also known as the quantifier-free type in Farah, Hart, and Sherman's model theoretic framework for tracial von Neumann algebras. However, the full type can also be…
This is an introduction to the algebras $A\subset B(H)$ that the linear operators $T:H\to H$ can form, once a complex Hilbert space $H$ is given. Motivated by quantum mechanics, we are mainly interested in the von Neumann algebras, which…
Cyclic monotone independence is an algebraic notion of noncommutative independence, introduced in the study of multi-matrix random matrix models with small rank. Its algebraic form turns out to be surprisingly close to monotone…
We define an analogue of the Fox derivatives for differential polynomial algebras and give a criterion for differential algebraic dependence of a finite system of elements. In particular, we prove that differential algebraic dependence of a…
We prove that if $A$ is a non-separable abelian tracial von Neuman algebra then its free powers $A^{*n}, 2\leq n \leq \infty$, are mutually non-isomorphic and with trivial fundamental group, $\mathcal F(A^{*n})=1$, whenever $2\leq…
We define a notion of an arithmetic set in an arbitrary countable group and study properties of these sets in the cases of Abelian groups and non-abelian free groups.
The theory of optimal choice sets offers a well-established solution framework in social choice and game theory. In social choice theory, decision-making is typically modeled as a maximization problem. However, when preferences are cyclic…
We prove that all definable pre-orders are atomic, in a finitely generated free algebra of a discriminator variety of finite similarity type which is generated by its finite members.
Suppose F is a finite set of selfadjoint elements in a tracial von Neumann algebra M. For $\alpha >0$, F is $\alpha$-bounded if the free packing $\alpha$-entropy of F is bounded from above. We say that M is strongly 1-bounded if M has a…
In the absence of the axiom of choice, the set-theoretic status of many natural statements about metrizable compact spaces is investigated. Some of the statements are provable in $\mathbf{ZF}$, some are shown to be independent of…