Related papers: Explanation of Independence
Two results are presented concerning the entailment problem in Separation Logic with inductively defined predicate symbols and theory reasoning. First, we show that the entailment problem is undecidable for rules with bounded tree-width, if…
In the context of continuous first-order logic, special attention is often given to theories that are somehow continuous in an 'essential' way. A common feature of such theories is that they do not interpret any infinite discrete…
The problem of algebraic dependence of solutions to (non-linear) first order autonomous equations over an algebraically closed field of characteristic zero is given a `complete' answer, obtained independently of model theoretic results on…
We investigate the notion of independence, which is at the basis of many, seemingly unrelated, properties of logic like Rational Monotony in non-monotonic logics, and interpolation theorems.
We give a full solution to the question of existence of indiscernibles in dependent theories by proving the following theorem: for every $\theta$ there is a dependent theory $T$ of size $\theta$ such that for all $\kappa$ and $\delta$,…
We continue the work on the relations between independence logic and the model-theoretic analysis of independence, generalizing the results of [15] and [16] to the framework of abstract independence relations for an arbitrary AEC. We give a…
An introduction is given to the logic of sheaves of structures and to set theoretic forcing constructions based on this logic. Using these tools, it is presented an alternative proof of the independence of the Continuum Hypothesis; which…
A dichotomy result of Sevenster (2014) completely classified the quantifier prefixes of regular Independence-Friendly (IF) logic according to the patterns of quantifier dependence they contain. On one hand, prefixes that contain "Henkin" or…
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…
Independence -- the study of what is relevant to a given problem of reasoning -- has received an increasing attention from the AI community. In this paper, we consider two basic forms of independence, namely, a syntactic one and a semantic…
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…
Kim's Lemma is a key ingredient in the theory of forking independence in simple theories. It asserts that if a formula divides, then it divides along every Morley sequence in type of the parameters. Variants of Kim's Lemma have formed the…
This paper investigates the satisfiability problem for Separation Logic, with unrestricted nesting of separating conjunctions and implications, for prenex formulae with quantifier prefix in the language $\exists^*\forall^*$, in the cases…
In the case of systems composed of identical particles, a typical instance in quantum statistical mechanics, the standard approach to separability and entanglement ought to be reformulated and rephrased in terms of correlations between…
Given an algebraic differential equation of order greater than one, it is shown that if there is any nontrivial algebraic relation amongst any number of distinct nonalgebraic solutions, along with their derivatives, then there is already…
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…
We consider relations with no order on their attributes as in Database Theory. An independent partition of the set of attributes S of a finite relation R is any partition X of S such that the join of the projections of R over the elements…
Let $\mathcal M=(M,<,...)$ be a linearly ordered first-order structure and $T$ its complete theory. We investigate conditions for $T$ that could guarantee that $\mathcal M$ is not much more complex than some colored orders (linear orders…
Determining when two knots are equivalent (more precisely isotopic) is a fundamental problem in topology. Here we formulate this problem in terms of Predicate Calculus, using the formulation of knots in terms of braids and some basic…
We study the notion of twisted conjugacy separability (essentially introduced in our previous paper for a proof of twisted version of Burnside-Frobenius theorem) and some related properties. We give examples of groups with and without this…