Related papers: Equiconsistency of the Minimalist Foundation with …
In this paper, we derive formulas for the Fr\'echet (singular) subdiferentials of the bilateral minimal time function $T:\mathbb{R}^n \times \mathbb{R}^n \to [0,+\infty]$ associated with a system governed by differential inclusions. As a…
Symmetric submodular function minimization admits purely combinatorial algorithms using special orderings of the ground set. Extending the minimum-cut algorithm of Nagamochi and Ibaraki (1992), Queyranne (1998) showed that the maximum…
Exponential-constructible functions are an extension of the class of constructible functions. This extension was formulated by Cluckers-Loeser in the context of semi-algebraic and sub-analytic structures, when they studied stability under…
The striking success of the Standard Model in explaining precision data and, at the same time, its lack of explanations for various fundamental phenomena, such as dark matter or the baryon asymmetry of the universe, suggests new physics at…
The Functional Machine Calculus (FMC), recently introduced by the authors, is a generalization of the lambda-calculus which may faithfully encode the effects of higher-order mutable store, I/O and probabilistic/non-deterministic input.…
Given an $n*n$ sparse symmetric matrix with $m$ nonzero entries, performing Gaussian elimination may turn some zeroes into nonzero values. To maintain the matrix sparse, we would like to minimize the number $k$ of these changes, hence…
It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented in the intuitionistic logic by double-negation, while the…
We propose a uniform way of defining for every logic ${\sf L}$ intermediate between intuitionistic and classical logics, the corresponding intermediate minimal tense logic ${\sf LK_t}$. This is done by building the fusion of two copies of…
We simplify the one-loop functional matching formalism to develop a streamlined prescription. The functional approach is conceptually appealing: all calculations are performed within the UV theory at the matching scale, and no prior…
We prove that the smallest minimizer s(f) of a real convex function f is less than or equal to a real point x if and only if the right derivative of f at x is non-negative. Similarly, the largest minimizer t(f) is greater or equal to x if…
While teaching untyped $\lambda$-calculus to undergraduate students, we were wondering why $\alpha$-equivalence is not directly inductively defined. In this paper, we demonstrate that this is indeed feasible. Specifically, we provide a…
We introduce the study of frames and equiangular lines in classical geometries over finite fields. After developing the basic theory, we give several examples and demonstrate finite field analogs of equiangular tight frames (ETFs) produced…
In this paper, we investigate several types of low complexity of finite partitions, including precompactness, zero maximal pattern entropy, bounded mean complexity and mean equicontinuity. We first show that a collection of finite…
We present Voevodsky's construction of a model of univalent type theory in the category of simplicial sets. To this end, we first give a general technique for constructing categorical models of dependent type theory, using universes to…
A new modification of the minimum-contrast estimator (the weighted MCE) of drift parameter in a linear stochastic evolution equation with additive fractional noise is introduced in the setting of the spectral approach (Fourier coordinates…
This work may be defined as a modern philosophical approach to theoretical physics. Since ancient times science and philosophy evolved in parallel, thus renewing from time to time the epochal paradigms of human thought. We could not…
I deal with two approaches to proof-theoretic semantics: one based on argument structures and justifications, which I call reducibility semantics, and one based on consequence among (sets of) formulas over atomic bases, called base…
Current language model evaluations measure what models know under ideal conditions but not how robustly they know it under realistic stress. Static benchmarks like MMLU and TruthfulQA cannot distinguish a model that lacks knowledge from one…
This thesis introduces the idea of two-level type theory, an extension of Martin-L\"of type theory that adds a notion of strict equality as an internal primitive. A type theory with a strict equality alongside the more conventional form of…
We exhibit canonical middle-inverse Choice maps within categorical (Free-Variable) Theory of Primitive Recursion as well as in Theory of partial PR maps over the Theory of Primitive Recursion with predicate abstraction. Using these…