Related papers: Independence in Arithmetic: The Method of $(\mathc…
We study the $p$-independence of spectra of Laplace operators on graphs arising from regular Dirichlet forms on discrete spaces. Here, a sufficient criterion is given solely by a uniform subexponential growth condition. Moreover, under a…
Variable independence and decomposability are algorithmic techniques for simplifying logical formulas by tearing apart connections between free variables. These techniques were originally proposed to speed up query evaluation in constraint…
We offer a new formalism for global explanations of pairwise feature dependencies and interactions in supervised models. Building upon SHAP values and SHAP interaction values, our approach decomposes feature contributions into synergistic,…
Originally introduced by Kolmann and Shelah as a surrogate for saturated models, limit models have been established as natural and useful objects when studying abstract elementary classes. Shelah began the study of when (multiple notions…
Parikh automata on finite words were first introduced by Klaedtke and Rue{\ss} [Automata, Languages and Programming, 2003]. In this paper, we introduce several variants of Parikh automata on infinite words and study their expressiveness. We…
We offer a mathematical proof of consistency for Peano Arithmetic PA formalizable in PA. This result is compatible with Goedel's Second Incompleteness Theorem since our consistency proof does not rely on the representation of consistency as…
It often happens that free algebras for a given theory satisfy useful reasoning principles that are not preserved under homomorphisms of algebras, and hence need not hold in an arbitrary algebra. For instance, if $M$ is the free monoid on a…
This paper concerns the study of Bi-colored expansions of geometric theories in the light of the Fra\"{i}ss\'{e}-Hrushovski construction method. Substructures of models of a geometric theory $T$ are expanded by a color predicate $p$, and…
We prove new linear independence results for the values of generalized hypergeometric functions ${}_pF_q$ at several distinct algebraic points, over arbitrary algebraic number fields. Our approach combines constructions of type II Pad\'{e}…
Boney and Grossberg [BG] proved that every nice AEC has an independence relation. We prove that this relation is unique: In any given AEC, there can exist at most one independence relation that satisfies existence, extension, uniqueness and…
Using formulas for certain quantities involving stable vectors, due to I. Molchanov, and in some cases utilizing the so-called divide and color model, we prove that certain families of integrals which, ostensibly, depend on a parameter are…
In the Handbook of Mathematical Logic, the Paris-Harrington variant of Ramsey's theorem is celebrated as the first result of a long 'search' for a purely mathematical incompleteness result in first-order arithmetic. This paper questions the…
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…
Shelah shows that certain revised countable support (RCS) iterations do not add reals. His motivation is to establish the independence (relative to large cardinals) of Avraham's problem on the existence of uncountable non-constuctible…
We present an explicit geometric construction of a large parametrized family of graphs with no $k$-cliques and with bounded independence number, generalizing the triangle-free Ramsey graphs of Codenotti, Pudl\'ak, and Resta and revisiting…
We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…
This paper is directed towards combining Pearl's structural-model approach to causal reasoning with high-level formalisms for reasoning about actions. More precisely, we present a combination of Pearl's structural-model approach with…
It was shown in \cite{sc12} that for a certain class of structures $\I$, $\I$-indexed indiscernible sets have the modeling property just in case the age of $\I$ is a Ramsey class. We expand this known class of structures from ordered…
Independent component analysis provides a principled framework for unsupervised representation learning, with solid theory on the identifiability of the latent code that generated the data, given only observations of mixtures thereof.…
A logic for specification and verification is derived from the axioms of Zermelo-Fraenkel set theory. The proofs are performed using the proof assistant Isabelle. Isabelle is generic, supporting several different logics. Isabelle has the…