Related papers: Equiconsistency of the Minimalist Foundation with …

Classical mathematical models used in the semantics of programming languages and computation rely on idealized abstractions such as infinite-precision real numbers, unbounded sets, and unrestricted computation. In contrast, concrete…

This paper is an attempt to solve the following problem: given a logic, how to turn it into a paraconsistent one? In other words, given a logic in which \emph{ex falso quodlibet} holds, how to convert it into a logic not satisfying this…

We prove that an algebraic flat connection has definable flat sections in the analytic exponential structure if and only if it is regular singular with unitary monodromy eigenvalues at infinity, refining previous work of Bakker and Mullane.…

Let $\partial \mathcal{Q}$ be the boundary of a convex polygon in $\mathbb{R}^2$, $e_\alpha = (\cos\alpha, \sin \alpha)$ and $e_{\alpha}^{\bot} = (-\sin\alpha , \cos \alpha)$ be a basis of $\mathbb{R}^2$ for some $\alpha\in[0,2\pi)$ and…

A study of the Model of Embedded Spaces (MES) with a relativistic version of Finslerian geometry is continued. The field equations of the MES (Einstein and Maxwell types) are derived, and this formally completes geometrization of classical…

Homotopy type theory is a new branch of mathematics, based on a recently discovered connection between homotopy theory and type theory, which brings new ideas into the very foundation of mathematics. On the one hand, Voevodsky's subtle and…

In [Phys. Rev. Lett. 128, 013001 (2022)] a novel ground state method was proposed. It has been suggested that this $i$-DMFT would be a method within one-particle reduced density matrix functional theory (DMFT), capable of describing…

We examine the interplay between projectivity (in the sense that was introduced by S.~Ghilardi) and uniform post-interpolant for the classical and intuitionistic propositional logic. More precisely, we explore whether a projective…

Two rooted locally finite trees are considered equivalent if both can be embedded into each other as topological minors by means of tree-order preserving mappings. By exploiting Nash-William's Theorem, Matthiesen provided a non-constructive…

Let $\mathfrak g$ be a finite-dimensional simple Lie algebra of type $D$ or $E$ and $\lambda$ be a dominant integral weight whose support bounds the subdiagram of type $D_4$. We study certain quantum affinizations of the simple $\mathfrak…

The Functional Machine Calculus (FMC, Heijltjes 2022) extends the lambda-calculus with the computational effects of global mutable store, input/output, and probabilistic choice while maintaining confluent reduction and simply-typed strong…

A mathematical framework for reduced density matrix functional theory (RDMFT) is proposed. The work is inspired by and generalizes the work by E.H.~Lieb [E.H. Lieb, Int. J. Quant. Chem. 24(1983), pp.243--277] on density-functional theory…

We summarize basic features associated to dynamical breaking of the electroweak symmetry. The knowledge of the phase diagram of strongly coupled theories as function of the number of colors, flavors and matter representation plays a…

Usual coset construction $\SU{k}\times\SU{l}/\SU{k+l}$ of Wess--Zumino conformal field theory is presented as a coset construction of minimal models. This new coset construction can be defined rigorously and allows one to calculate easily…

In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic and classical logics. We prove a completeness theorem for this logic with respect to a Kripke semantics. We establish…

Reasoning modulo equivalences is natural for everyone, including mathematicians. Unfortunately, in proof assistants based on type theory, equality is appallingly syntactic and, as a result, exploiting equivalences is cumbersome at best.…

We propose a new bi-intuitionistic type theory called Dualized Type Theory (DTT). It is a simple type theory with perfect intuitionistic duality, and corresponds to a single-sided polarized sequent calculus. We prove DTT strongly…

We study modal team logic MTL, the team-semantical extension of modal logic ML closed under Boolean negation. Its fragments, such as modal dependence, independence, and inclusion logic, are well-understood. However, due to the unrestricted…

Let \H_r be the generic type A Hecke algebra defined over \ZZ[u, u^{-1}]. The Kazhdan-Lusztig bases \{C_w\}_{w \in \S_r} and \{C'_w\}_{w \in \S_r} of \H_r give rise to two different bases of the Specht module M_\lambda, \lambda \vdash r, of…

Mapping UV theories onto low energy effective descriptions is a procedure known as matching. The last decade has seen tremendous progress in the development of new tools for efficiently performing matching calculations, by relying on…