Related papers: Abstract independence relations in neostability th…

In general relativity, the causal structure between events is dynamical, but it is definite and observer-independent; events are point-like and the membership of an event A in the future or past light-cone of an event B is an…

We give an almost entirely model-theoretic account of both Ramsey classes of finite structures and of generalized indiscernibles as studied in special cases in (for example) [7], [9]. We understand "theories of indiscernibles" to be special…

Heckerman (1993) defined causal independence in terms of a set of temporal conditional independence statements. These statements formalized certain types of causal interaction where (1) the effect is independent of the order that causes are…

In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalizing, in this logic, two principles that we call non-contradictory…

The concept of distinguishability lies at the heart of quantum information theory. We introduce \textit{left-right relative entropy} as a quantitative measure of distinguishability within the space of boundary states in two-dimensional…

This article contributes to the debate of the meaning of relationalism and background independence, which has remained of interest in theoretical physics from Newton versus Leibniz through to foundational issues for today's leading…

In this paper, we derive a new generalisation of the strong subadditivity of the entropy to the setting of general conditional expectations onto arbitrary finite-dimensional von Neumann algebras. The latter inequality, which we call…

We introduce a weakly supervised approach for inferring the property of abstractness of words and expressions in the complete absence of labeled data. Exploiting only minimal linguistic clues and the contextual usage of a concept as…

The standard state-dependent Heisenberg-Robertson uncertainly-relation lower bound fails to capture the quintessential incompatibility of observables as the bound can be zero for some states. To remedy this problem, we establish a class of…

We give definitions of the properties OP, IP, $k$-TP, TP$_1$, $k$-TP$_2$, SOP$_1$, SOP$_2$ and SOP$_3$ in positive logic, and prove various implications and equivalences between them. We also provide a characterisation of stability in…

Besides well-known conditions of locality or factorisability, deriving the Bell inequalities requires assuming that the distribution of hidden variables and Alice's and Bob's measurement settings be independent of each other. We show that…

In this paper we generalize the DP framework to a relative DP framework, where a so called split is possible.

We build a notion of algebraic recognition for visibly pushdown languages by finite algebraic objects. These come with a typical Eilenberg relationship, now between classes of visibly pushdown languages and classes of finite algebras.…

Dependence is undoubtedly a central concept in statistics. Though, it proves difficult to locate in the literature a formal definition which goes beyond the self-evident 'dependence = non-independence'. This absence has allowed the term…

For analysis of a high-dimensional dataset, a common approach is to test a null hypothesis of statistical independence on all variable pairs using a non-parametric measure of dependence. However, because this approach attempts to identify…

We report assumption-free bounds for any contrast between the probabilities of the potential outcome under exposure and non-exposure when the confounders are missing not at random. We assume that the missingness mechanism is…

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…

Abstraction is a powerful idea widely used in science, to model, reason and explain the behavior of systems in a more tractable search space, by omitting irrelevant details. While notions of abstraction have matured for deterministic…

While hidden class models of various types arise in many statistical applications, it is often difficult to establish the identifiability of their parameters. Focusing on models in which there is some structure of independence of some of…

Revealing the implicit semantic relation between the constituents of a noun-compound is important for many NLP applications. It has been addressed in the literature either as a classification task to a set of pre-defined relations or by…