Related papers: Note on $\mathsf{TD} + \mathsf{DC}_\mathbb{R}$ imp…

A few families of counterexamples are provided to "A proof that the discrete singular convolution (DSC)/Lagrange-distributed approximation function (LDAF) method is inferior to high order finite differences", Journal of Computational…

We give a short proof of the main algebraic result of \cite{zilber2006covers}, also known as the `thumbtack lemma'.

Using nonstandard analysis, a very short and elementary proof of the Doob-Meyer decomposition and the Dol{\'e}ans Dade theorems is provided.

This paper introduces a new category, Edgl, of enriched differential graded Lie algebras (edgl), directly related to the topology of all connected CW complexes and simplicial sets. It is equipped with a homotopy theory analogous to that…

We consider the fundamental problem of inferring the causal direction between two univariate numeric random variables $X$ and $Y$ from observational data. The two-variable case is especially difficult to solve since it is not possible to…

This work presents the deductive system Double Propositional Logic, LD, along with the semantics of possible worlds that characterize it. LD includes an alternate affirmation operator and an alternate negation operator and is not valid for…

The connection method has earned good reputation in the area of automated theorem proving, due to its simplicity, efficiency and rational use of memory. This method has been applied recently in automatic provers that reason over ontologies…

Each Multiplicative Exponential Linear Logic (MELL) proof-net can be expanded into a differential net, which is its Taylor expansion. We prove that two different MELL proof-nets have two different Taylor expansions. As a corollary, we prove…

Strongly Turing determinacy, or $\mathrm{sTD}$, says that for any set $A$ of reals, if $\forall x\exists y\geq_T x (y\in A)$, then there is a pointed set $P\subseteq A$. We prove the following consequences of Turing determinacy…

Linear TD($\lambda$) is one of the most fundamental reinforcement learning algorithms for policy evaluation. Previously, convergence rates are typically established under the assumption of linearly independent features, which does not hold…

We consider mainly the following version of set theory:"ZF + DC and for every $\lambda,\lambda^{\aleph_0}$ is well ordered", our thesis is that this is a reasonable set theory, e.g. much can be said. In particular, we prove that for a…

This study presents a long-range descriptor for machine learning force fields (MLFFs) that maintains translational and rotational symmetry, similar to short-range descriptors while being able to incorporate long-range electrostatic…

Let $T$ be a complete, model complete o-minimal theory extending the theory RCF of real closed ordered fields in some appropriate language $L$. We study derivations $\delta$ on models $\mathcal{M}\models T$. We introduce the notion of a…

This note fills a gap in the article with title above [1]. We provide the proof of Equation (82) of Lemma 5 in [1] and thereby complete its power counting analysis with a more precise next-to-leading-order estimate.

In this paper we generalize the result valid for associative rings due \cite[Martindale III]{Mart} and \cite[Bre$\check{s}$ar]{bresar} to alternative rings. Let $\mathfrak{R}$ be an unital alternative ring, and $\mathfrak{D}: \mathfrak{R}…

The disjoint paths logic, FOL+DP, is an extension of First-Order Logic (FOL) with the extra atomic predicate $\mathsf{dp}_k(x_1,y_1,\ldots,x_k,y_k),$ expressing the existence of internally vertex-disjoint paths between $x_i$ and $y_i,$ for…

In this work we present a computation paradigm based on a concurrent and incremental construction of proof nets (de-sequentialized or graphical proofs) of the pure multiplicative and additive fragment of Linear Logic, a resources conscious…

Linear complementary-dual (LCD for short) codes are linear codes that intersect with their duals trivially. LCD codes have been used in certain communication systems. It is recently found that LCD codes can be applied in cryptography. This…

Let $a,~f$ be elements in a ring with pseudo core inverses $a^{\scriptsize\textcircled{\tiny D}}$, $f^{\scriptsize\textcircled{\tiny D}}$, and let $b=f-a$. We prove that the absorption law $a^{\scriptsize\textcircled{\tiny…

Temporal difference learning (TD) is a simple iterative algorithm used to estimate the value function corresponding to a given policy in a Markov decision process. Although TD is one of the most widely used algorithms in reinforcement…