Related papers: Corrigendum to "Kim-independence in positive logic…
This paper is an extension of the work about the exponential increase of the power of two non-parametric tests: the $ Z $-test and the chi-square goodness-of-fit test. Subject to having auxiliary information, it is possible to improve…
In this paper we prove the theorem on freedom for relatively free Lie algebras with a single relation (analogous with the well-known result of Shirshov) and a generalized Freiheitssatz for relatively free Lie algebras (analogous with the…
The role of complex quantities in quantum theory has been puzzling physicists since the beginnings. It is thus natural to ask whether, in order to describe our experiments, the mathematical structure of complex Hilbert spaces it is built on…
We develope the framework of transitional conditional independence. For this we introduce transition probability spaces and transitional random variables. These constructions will generalize, strengthen and unify previous notions of…
The statement of Lemma 3.1 in the published paper is not correct. Lemma 3.1 is needed for the proof of Theorem 3.2. Theorem 3.2 as originally stated is true but its "proof" is not correct. Here we change the statements and proofs of Lemma…
In this paper, we first establish a K-theory version of the equivariant family index theorem for a circle action, then use it to prove several rigidity and vanishing theorems on the equivariant K-theory level.
There is an irreparable error in the proof of Theorem 3.26 in our "Model Theory of Fields with Virtually Free Group Actions" paper and we withdraw the claim of having proved that theorem. In fact, that theorem is false in a very strong…
Formal reasoning about hashing-based probabilistic data structures often requires reasoning about random variables where when one variable gets larger (such as the number of elements hashed into one bucket), the others tend to be smaller…
Kotlarski's theorem (see H. Kotlarski. Bounded Induction and Satisfaction Classes. Mathematical Logic Quarterly, vol. 32, 31-34, 1986, P. 531--544.) formalized in $WKL_0$.
We prove a stronger version of a termination theorem appeared in the paper "On existence of log minimal models II". We essentially just get rid of the redundant assumptions so the proof is almost the same as in there. However, we give a…
We propose a slight correction and a slight improvement on the main result contained in "A lecture on Classical KAM Theorem" by J. P{\"o}schel.
This course introduces the fruitful links between model theory and a combinatoric of sets given by independence relations. An independence relation on a set is a ternary relation between subsets. Chapter 1 should be considered as an…
I develop in depth the machinery of $(\mathcal L, n)$-models originally introduced by Shelah and, independently in a slightly different form by Kripke. This machinery allows fairly routine constructions of true but unprovable sentences in…
We show that it is coNP-complete to decide whether a given proof structure of pomset logic is a correct proof net, using the graph-theoretic used in a previous paper of ours (arXiv:1901.10247).
In this note let us give two remarks on proof-theory of PA. First a derivability relation is introduced to bound witnesses for provable $\Sigma_{1}$-formulas in PA. Second Paris-Harrington's proof for their independence result is…
Does the class of linear orders have (one of the variants of) the so called (lambda, kappa)-limit model? It is necessarily unique, and naturally assuming some instances of G.C.H. we get some positive, i.e. existence results. More generally,…
We propose some formulations of the notion of "operational independence" of two subsystems of a larger quantum system and clarify their relation to other independence concepts in the literature. In addition, we indicate why the operational…
We provide self-contained proof of a theorem relating probabilistic coherence of forecasts to their non-domination by rival forecasts with respect to any proper scoring rule. The theorem appears to be new but is closely related to results…
In the literature there are two different notions of lovely pairs of a theory T, according to whether T is simple or geometric. We introduce a notion of lovely pairs for an independence relation, which generalizes both the simple and the…
Positive logic is a generalisation of full first-order logic that does not have negation built in. Still, many model-theoretic ideas, tools and techniques work perfectly fine in positive logic. Importantly, there is a compactness theorem.…