Related papers: Independence in Arithmetic: The Method of $(\mathc…
Historically, proofs of $\mathrm{BPI}$ in models without choice have relied on a contradiction framework that was introduced by Halpern. We introduce the filter extension property for permutation models and symmetric extensions, which…
We study the problem of extending an abstract independence notion for types of singletons (what Shelah calls a good frame) to longer types. Working in the framework of tame abstract elementary classes, we show that good frames can always be…
We describe a formal proof of the independence of the continuum hypothesis ($\mathsf{CH}$) in the Lean theorem prover. We use Boolean-valued models to give forcing arguments for both directions, using Cohen forcing for the consistency of…
The Linear Independence hypothesis (LI), which states roughly that the imaginary parts of the critical zeros of Dirichlet L-functions are linearly independent over the rationals, is known to have interesting consequences in the study of…
In a recent paper, Herbelin developed a calculus dPA$^\omega$ in which constructive proofs for the axioms of countable and dependent choices could be derived via the encoding of a proof of countable universal quantification as a stream of…
We study randomness beyond $\Pi^1_1$-randomness and its Martin-L\"of type variant, introduced in \cite{MR2340241} and further studied in \cite{Continuous-higher-randomness}. The class given by the infinite time Turing machines (\ITTM s),…
Recursive saturation and resplendence are two important notions in models of arithmetic. Kaye, Kossak, and Kotlarski introduced the notion of arithmetic saturation and argued that recursive saturation might not be as rigid as first assumed.…
Testing mutual independence among multiple random variables is a fundamental problem in statistics, with wide applications in genomics, finance, and neuroscience. In this paper, we propose a new class of tests for high-dimensional mutual…
We study Dirichlet forms and Laplacians on self-similar sets with overlaps. A notion of "finitely ramified of finite type($f.r.f.t.$) nested structure" for self-similar sets is introduced. It allows us to reconstruct a class of self-similar…
Elliptic and parabolic integro-differential model problems are considered in the whole space. By verifying H\"ormander condition, the existence and uniqueness is proved in L_{p}-spaces of functions whose regularity is defined by a scalable,…
Let $E$ be an elliptic curve, with identity $O$, and let $C$ be a cyclic subgroup of odd order $N$, over an algebraically closed field $k$ with $\operatorname{char} k \nmid N$. For $P \in C$, let $s_P$ be a rational function with divisor $N…
In this short survey article, we present an elementary, yet quite powerful, method of enumerating independent sets in graphs. This method was first employed more than three decades ago by Kleitman and Winston and has subsequently been used…
This short expository paper outlines applications of computer algebra to the implication problem of conditional independence for Gaussian random variables. We touch on certificates for validity and invalidity of inference rules from the…
The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are non-null in a…
We study the strength of $\RRT^3_2$, Rainbow Ramsey Theorem for colorings of triples, and prove that $\RCA + \RRT^3_2$ implies neither $\WKL$ nor $\RRT^4_2$. To this end, we establish some recursion theoretic properties of cohesive sets and…
Shapley values have become increasingly popular in the machine learning literature thanks to their attractive axiomatisation, flexibility, and uniqueness in satisfying certain notions of `fairness'. The flexibility arises from the myriad…
In one of our previous papers we proved that, for an infinite set A and p\in[1,\infty), the embedded version of the Lipscomb's space L(A) in l^{p}(A), p\in[1,\infty), with the metric induced from l^{p}(A), denoted by {\omega}_{p}^{A}, is…
The purpose is to study the strength of Ramsey's Theorem for pairs restricted to recursive assignments of $k$-many colors, with respect to Intuitionistic Heyting Arithmetic. We prove that for every natural number $k \geq 2$, Ramsey's…
Natural numbers are represented by Grzegorczyk functions. The representation is implicit in the technique of H. Friedman. An iterated base-shift in the representation with subtracting 1 yields a sequence, Grzegorczyk sequence. It is shown…
Testing (conditional) independence of multivariate random variables is a task central to statistical inference and modelling in general - though unfortunately one for which to date there does not exist a practicable workflow. State-of-art…