Related papers: Note on $\mathsf{TD} + \mathsf{DC}_\mathbb{R}$ imp…
We present an $L$-like construction that produces the minimal model of $\mathsf{AD}_\mathbb{R}+$"$\Theta$ is regular". In fact, our construction can produce any model of $\mathsf{AD}^++\mathsf{AD}_\mathbb{R}+V=L(P(\mathbb{R}))$ in which…
$\mathsf{ZF + AD}$ proves that for all nontrivial forcings $\mathbb{P}$ on a wellorderable set of cardinality less than $\Theta$, $1_{\mathbb{P}} \Vdash_{\mathbb{P}} \neg\mathsf{AD}$. $\mathsf{ZF + AD} + \Theta$ is regular proves that for…
Simple and shorter proofs of two Dirac-type theorems involving connectivity are presented.
A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…
We show that the Axiom of Real Determinacy $\mathsf{AD}_{\mathbb{R}}$ and the Axiom of Real Blackwell Determinacy $\mathsf{Bl}\text{-}\mathsf{AD}_{\mathbb{R}}$ are equivalent in $\mathsf{ZF}$+$\mathsf{DC}$. This answers the question of…
We show that assuming $\mathsf{ZF}+\mathsf{AD}^+ +$ "$V = \mathrm{L} \bigl(\wp (\mathbb{R})\bigr)$", any poset which increases $\Theta$ does not preserve the truth of $\mathsf{AD}$. We also show that in $\mathsf{ZF} + \mathsf{AD}$, any…
The Suslin hypothesis states that there are no nonseparable complete dense linear orderings without endpoints which have the countable chain condition. $\mathsf{ZF + AD^+ + V = L(\mathscr{P}(\mathbb{R}))}$ proves the Suslin hypothesis. In…
Being reformulated in the color dipole basis of small-x QCD Adler's theorem establishes a connection between perturbative and non-perturbative descriptions of DIS and quantifies the effect of non-perturbative dynamics on…
Recently, Linear Complementary Dual (LCD) codes have garnered substantial interest within coding theory research due to their diverse applications and favorable attributes. This paper directs its attention to the construction of binary and…
Minimal log discrepancies (mld's) are related not only to termination of log flips, and thus to the existence of log flips but also to the ascending chain condition (acc) of some global invariants and invariants of singularities in the Log…
Since its discovery, differential linear logic (DLL) inspired numerous domains. In denotational semantics, categorical models of DLL are now commune, and the simplest one is Rel, the category of sets and relations. In proof theory this…
Many reinforcement learning approaches rely on temporal-difference (TD) learning to learn a critic. However, TD-learning updates can be high variance. Here, we introduce a model-based RL framework, Taylor TD, which reduces this variance in…
We show that in $L(\mathbb{R})$, assuming large cardinals, $\mathsf{HOD} {\parallel}\eta^{+\mathsf{HOD}}$ is locally definable from $\mathsf{HOD} {\parallel}\eta$ for all $\mathsf{HOD}$-cardinals $\eta\in [\boldsymbol{\delta}^2_1,\Theta)$.…
The validity of the Addition Theorem for algebraic entropies $\ent_L$ induced by non-discrete length functions $L$ on the category of locally $L$-finite modules over arbitrary rings is proved. Concrete examples of non-discrete length…
In the last 20 years many proposals have been made to incorporate non-monotonic reasoning into description logics, ranging from approaches based on default logic and circumscription to those based on preferential semantics. In particular,…
Let $(X,\Delta)$ be a normal pair with a projective morphism $X \to Z$ and let $A$ be a relatively ample $\mathbb{R}$-divisor on $X$. We prove the termination of some minimal model program on $(X,\Delta+A)/Z$ and the abundance conjecture…
There is an increasing body of literature proposing new and efficient persistent versions of concurrent data structures ensuring that a consistent state can be recovered after a power failure or a crash. Their correctness is typically…
In the context of $\mathsf{ZF}+\mathsf{DC}$, we force $\mathsf{DC}_\kappa$ for relations on $\mathcal{P}(\kappa)$ for $\kappa{}<\aleph_\omega$ over the Chang model $\mathrm{L}(\mathrm{Ord}^\omega)$ making some assumptions on the thorn…
Differential Linear Logic enriches Linear Logic with additional logical rules for the exponential connectives, dual to the usual rules of dereliction, weakening and contraction. We present a proof-net syntax for Differential Linear Logic…
The logical analysis of data, LAD, is a technique that yields two-class classifiers based on Boolean functions having disjunctive normal form (DNF) representation. Although LAD algorithms employ optimization techniques, the resulting binary…