Related papers: Dathematics: A Meta-isomorphic Version of 'Standar…
Over a field of characteristic zero, we show that two commutative differential graded (dg) algebras are quasi-isomorphic if and only if they are quasi-isomorphic as associative dg algebras. This answers a folklore problem in rational…
Differentiable logics are a family of quantitative logics originated in the machine learning literature. Because of their origin, differentiable logics often come equipped with analytic properties that guarantee that they are…
Set theoretical paradoxes have a common root -- lack of understanding of why some multitudes are not sets. Why some multitudes of objects of thought cannot themselves be objects of thought? Moreover, it is a logical truth that such…
There is a substantial curricular overlap between calculus and physics, yet introductory physics students often struggle to connect the two. We introduce a quantity-based framing of the Fundamental Theorem of Calculus (FTC) to help unify…
The use of meta-rules in logic, i.e., rules whose content includes other rules, has recently gained attention in the setting of non-monotonic reasoning: a first logical formalisation and efficient algorithms to compute the (meta)-extensions…
In this paper, we describe the formalization of the axiom of choice and several of its famous equivalent theorems in Morse-Kelley set theory. These theorems include Tukey's lemma, the Hausdorff maximal principle, the maximal principle,…
This paper presents matching logic, a first-order logic (FOL) variant for specifying and reasoning about structure by means of patterns and pattern matching. Its sentences, the patterns, are constructed using variables, symbols, connectives…
The investigations on higher-order type theories and on the related notion of parametric polymorphism constitute the technical counterpart of the old foundational problem of the circularity (or impredicativity) of second and higher order…
Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces---so-called ``topological semantics''. The first is classical higher-order logic, with…
Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…
A little-known and highly economical characterization of the real interval [0, 1], essentially due to Freyd, states that the interval is homeomorphic to two copies of itself glued end to end, and, in a precise sense, is universal as such.…
A brief survey of some basic ideas of the so-called Idempotent Mathematics is presented; an "idempotent" version of the representation theory is discussed. The Idempotent Mathematics can be treated as a result of a dequantization of the…
We provide solutions to several problems of Foreman about ideals, several of which are closely related to Mitchell's notion of \emph{strongly proper} forcing. We prove: 1) Presaturation of a normal ideal implies projective antichain…
Conventional optimization methods in machine learning and controls rely heavily on first-order update rules. Selecting the right method and hyperparameters for a particular task often involves trial-and-error or practitioner intuition,…
Let $M$ and $N$ be smooth manifolds, with $M$ closed and connected. If the $C^r$--diffeomorphism group of $M$ is elementarily equivalent to the $C^s$--diffeomorphism group of $N$ for some $r,s\in[1,\infty)\cup\{0,\infty\}$, then $r=s$ and…
Metatheorems about type theories are often proven by interpreting the syntax into models constructed using categorical gluing. We propose to use only sconing (gluing along a global section functor) instead of general gluing. The sconing is…
Let V be the universe of sets and V_{\alpha} the sets of rank \leq\alpha. We develop some axiom schemata for set theory based on the following three assumptions: 1. V \models ZFC 2. V is large with respect to the class of ordinals 3. V is…
We apply, in the context of semigroups, the main theorem from~\cite{higjac} that an elementary class $\mathcal{C}$ of algebras which is closed under the taking of direct products and homomorphic images is defined by systems of equations. We…
We develop category theory within Univalent Foundations, which is a foundational system for mathematics based on a homotopical interpretation of dependent type theory. In this system, we propose a definition of "category" for which equality…
The thesis of this paper is that truth-relevant logic is a better foundation for mathematics than classical logic. It is a system proposed by Richard Diaz in 1981. In a certain sense t-relevant logic is based on Kleene strong tables. These…