Related papers: Corrigendum to "Kim-independence in positive logic…

Ordinary first-order logic has the property that two formulas \phi and \psi have the same meaning in a structure if and only if the formula ``\phi iff \psi'' is true in the structure. We prove that independence-friendly logic does not have…

We extend logical categories with fiberwise interior and closure operators so as to obtain an embedding theorem into powers of the category of topological spaces. The required axioms, besides the Kuratowski closure axioms, are a `product…

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 give a purely logical proof of the J. Conway and S. Kochen Free Will theorem concerning undeterminacy in Quantum Mechanics (Notices of the AMS, February 2009, Vol. 56/2, p. 226). The logical method seems to be very powerful.

Intuitionistic dependence logic was introduced by Abramsky and Vaananen (2009) as a variant of dependence logic under a general construction of Hodges' (trump) team semantics. It was proven that there is a translation from intuitionistic…

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

We show that the d -separation criterion constitutes a valid test for conditional independence relationships that are induced by feedback systems involving discrete variables.

In this paper, we consider the problem of testing independence in high-dimensional settings with missing data. Building upon a recently proposed Kendall-based statistic, we introduce two new modifications specifically designed to…

We explicitly fix a mistake in a preliminary statement of our previous paper on the conductor at a multiplanar singularity. The correction is not immediate and, though the mistake does not affect correctness of the subsequent results, the…

We prove that externally definable sets in first order NIP theories have honest definitions, giving a new proof of Shelah's expansion theorem. Also we discuss a weak notion of stable embeddedness true in this context. Those results are then…

Two recent, prominent theorems--the "no-go theorem for observer-independent facts" and the "Local Friendliness no-go theorem"--employ so-called extended Wigner's friend scenarios to try to impose novel, non-trivial constraints on the…

The gauge dependence problem existing in the original Gribov-Zwanziger theory is discussed.

We extend the main result of (G. Badia and G. Olkhovikov. A Lindstr\"om theorem for intuitionistic propositional logic. Notre Dame Journal of Formal Logic, 61 (1): 11--30 (2020)) to the first-order intuitionistic logic (with and without…

The famous equivalence theorem is reexamined in order to make it applicable to the case of intrinsically quantum infinite-component effective theories. We slightly modify the formulation of this theorem and prove it basing on the notion of…

We give a new independent proof of a generalised version of the theorem by Rashevskii, which appeared in [Uch. Zapiski Ped. Inst. K. 2 (1938), 83 -- 94] and from which the classical Chow-Rashevskii Theorem follows as a corollary. The proof…

We introduce an independence criterion based on entropy regularized optimal transport. Our criterion can be used to test for independence between two samples. We establish non-asymptotic bounds for our test statistic and study its…

This paper has been withdrawn by the author due to an error in the proof of Theorem 1.

A relevant thesis is that for the family of complete first order theories with NIP (i.e. without the independence property) there is a substantial theory, like the family of stable (and the family of simple) first order theories. We examine…

In 1985, Yu. V. Nesterenko produced a criterion for linear independence, which is a variant of Siegel's. While Siegel uses upper bounds on full systems of forms, Nesterenko uses upper and lower bounds on sufficiently dense sequences of…

This paper has been withdrawn due to a error in Theorem 3.1.