Related papers: Independence in Arithmetic: The Method of $(\mathc…
We define a new class of infinitary logics $\mathscr L^1_{\kappa,\alpha}$ generalizing Shelah's logic $\mathbb L^1_\kappa$ defined in \cite{MR2869022}. If $\kappa=\beth_\kappa$ and $\alpha <\kappa$ is infinite then our logic coincides with…
In this paper, we prove the following: If $n\ge3$, there is a generic extension of $L$ -- the constructible universe -- in which it is true that the Separation principle holds for both effective (lightface) classes $\varSigma^1_n$ and…
We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…
We consider implicit definability of the standard part {0,1,...} in nonstandard models of Peano arithmetic (PA), and we ask whether there is a model of PA in which the standard part is implicitly definable. In section 1, we define a certain…
Graph independence (also known as $\epsilon$-independence or $\lambda$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and operator algebras. Using conjugation by certain…
The main result provide a common generalization for Ramsey-type theorems concerning finite colorings of edge sets of complete graphs with vertices in infinite semigroups. We capture the essence of theorems proved in different fields: for…
The method of imsets, introduced by Studen\'y, provides a geometric and combinatorial description of conditional independence statements. Elementary conditional independence statements over a finite set of discrete random variables…
We develop the theory of Kim-independence in the context of NSOP$_{1}$ theories satsifying the existence axiom. We show that, in such theories, Kim-independence is transitive and that $\ind^{K}$-Morley sequences witness Kim-dividing. As…
In this article, we establish a new linear independence criterion for the values of certain {\it Lauricella hypergeometric series} $F_D$ with rational parameters, in both the complex and $p$-adic settings, over an algebraic number field.…
We establish an assume-guarantee (AG) framework for compositional reasoning about multi-objective queries in parametric probabilistic automata (pPA) - an extension to probabilistic automata (PA), where transition probabilities are functions…
We make use of a forcing technique for extending Boolean algebras. The same type of forcing was employed in [BK81], [Kos99], and elsewhere. Using and modifying a lemma of Koszmider, and using CH, we obtain an atomless BA, A such that f(A) =…
We prove explicit versions of the Kronecker-Weyl theorems, both in a discrete and a continuous settings, without any linear independence hypothesis. As an application, we propose an alternative approach to problems concerning asymptotic…
In this paper we investigate using the methodology of algebraic logic, deep algebraic results to prove three new omitting types theorems for finite variable fragments of first order logic. As a sample, we show that it T is an L_n theory and…
Independence and conditional independence are fundamental concepts for reasoning about groups of random variables in probabilistic programs. Verification methods for independence are still nascent, and existing methods cannot handle…
We give category-theoretic reformulations of stability, NIP, NTP, and non-dividing by observing that their characterisations in terms of indiscernible sequences are naturally expressed as Quillen lifting properties %(negation) of certain…
We prove that all monomials of $\kappa$-classes and $\psi$-classes are independent in $R^k(\ocM_{g,n})/R^k(\partial\ocM_{g,n})$ for all $k \leq [g/3]$. We also give a simple argument for $\kappa_l \neq 0$ in $R^l(\mathcal{M}_g)$ for $l \leq…
Conditional independence is a crucial concept supporting adequate modelling and efficient reasoning in probabilistics. In knowledge representation, the idea of conditional independence has also been introduced for specific formalisms, such…
In this note we study graphs $G_r$ with the property that every colouring of $E(G_r)$ with $r+1$ colours admits a copy of some graph $H$ using at most $r$ colours. For $1\le r\le e(H)$ such graphs occur naturally at intermediate steps in…
We introduce $\infty$-type theories as an $\infty$-categorical generalization of the categorical definition of type theories introduced by the second named author. We establish analogous results to the previous work including the…
This is my working paper on a proposed logical framework for the practice of mathematics, which is paralleled by philosophical considerations and a computer implementation (a variant of Automath). Updated 10/27/2016 with a version from…