Related papers: Weak K\"{o}nig's lemma implies the uniform continu…

We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…

We give simple proofs, under minimal hypotheses, of the Weak Law of Large Numbers and the Central Limit Theorem for independent identically distributed random variables. These proofs use only the elementary calculus, together with the most…

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 introduce the notion of weak Lie 2-bialgebra. Roughly, a weak Lie 2-bialgebra is a pair of compatible 2-term $L_\infty$-algebra structures on a vector space and its dual. The compatibility condition is described in terms of the big…

We introduce a weak version of the classical length function, termed the weak length function, defined on subsets of $R$-modules over a unital ring $R$, and further consider the concept of mean weak length for $R\Gamma$-modules associated…

We show that, under some mild hypotheses, the Gowers uniformity norms (both in the additive and in the hypergraph setting) are essentially equivalent to certain weaker norms which are easier to understand. We present two applications of…

We obtain a generalization of the DeGiorgi Lemma to the infinitely degenerate regime and apply it to obtain continuity of weak solutions to certain infinitely degenerate equations. This reproduces the continuity result obtained in…

We introduce trace definability, a weak notion of interpretability, and trace equivalence, a weak notion of equivalence for first order structures and theories. In particular we get an interesting weak equivalence notion for $\mathrm{NIP}$…

For many years, I have been interested in introducing students to the development of complex systems by means of modelling and refinement. To this end, I did not find anything better than presenting many examples of system developments.…

We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…

IIn the context of a weak formal theory called Basic Intuitionistic Mathematics $\mathsf{BIM}$, we study Brouwer's Fan Theorem and a strong negation of the Fan Theorem, Kleene's Alternative (to the Fan Theorem). We prove that the Fan…

We discuss the (twisted) weak positivity theorem. We also treat some applications.

In his constructive development of complex analysis, Errett Bishop used restrictive notions of homotopy and simple connectedness. Working in Bishop-style constructive mathematics, we prove Cauchy's integral theorem using the standard…

Let $(K,\mathcal O,k)$ be a $p$-modular system and assume $k$ is algebraically closed. We show that if $\Lambda$ is an $\mathcal O$-order in a separable $K$-algebra, then $\textrm{Pic}_{\mathcal O}(\Lambda)$ carries the structure of an…

Coinductive reasoning about infinitary structures such as streams is widely applicable. However, practical frameworks for developing coinductive proofs and finding reasoning principles that help structure such proofs remain a challenge,…

We prove an almost sure weak limit theorem for simple linear rank statistics for samples with continuous distributions functions. As a corollary the result extends to samples with ties, and the vector version of an a.s. central limit…

We explain how any cofibrantly generated weak factorisation system on a category may be equipped with a universally and canonically determined choice of cofibrant replacement. We then apply this to the theory of weak omega-categories,…

We prove matching direct and inverse theorems for uniform polynomial approximation with $A^*$ weights (a subclass of doubling weights suitable for approximation in the $L_\infty$ norm) having finitely many zeros and not too "rapidly…

We provide a simple and short proof of the Karush-Kuhn-Tucker theorem with finite number of equality and inequality constraints. The proof relies on an elementary linear algebra lemma and the local inverse theorem.

Two approaches to Lipschitz structures for any set are presented, studied and compared. The first approach is similar to the one proposed in Fraser, Jr. R. B., Axiom systems for Lipschitz structures, Fundamenta Mathematicae, (1970), where…