Related papers: On the Compatibility of Constructive Predicative M…
I argue against the predominant view of Weyl's interpretation of the logical signs. Drawing on his correctness-first account of mathematical knowledge, I point out that, according to him, quantified statements generate conditional…
Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…
The present paper deals with the representation theory of the reflection equation algebra, connected with a Hecke type R-matrix. Up to some reasonable additional conditions the R-matrix is arbitrary (not necessary originated from quantum…
We show that certain characteristic varieties of a finitely generated module over a given Weyl algebra arising from weighted degree filtrations are equal to the critical cone of some other characteristic varieties. This behaviour of the…
The Weyl-Wigner correspondence prescription, which makes large use of Fourier duality, is reexamined from the point of view of Kac algebras, the most general background for noncommutative Fourier analysis allowing for that property. It is…
We introduce a notion of "weak model category" which is a weakening of the notion of Quillen model category, still sufficient to define a homotopy category, Quillen adjunctions, Quillen equivalences and most of the usual construction of…
One may formulate the dependent product types of Martin-L\"of type theory either in terms of abstraction and application operators like those for the lambda-calculus; or in terms of introduction and elimination rules like those for the…
This work investigates the algorithmic complexity of non-classical logics, focusing on superintuitionistic and modal systems. It is shown that propositional logics are usually polynomial-time reducible to their fragments with at most two…
Conformal prediction (CP) is widely presented as distribution-free predictive inference with finite-sample marginal coverage under exchangeability. We argue that CP is best understood as a rank-calibrated descendant of the…
If we define classical foundational concepts constructively, and introduce non-algorithmic effective methods into classical mathematics, then we can bridge the chasm between truth and provability, and define computational methods that are…
The foundations of mathematics have long been considered settled by the Zermelo-Fraenkel-Choice axioms. But set theory abounds in models with different truths and even classical questions such as the measurability of projective sets can…
Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…
In the paper, we review the recent construction of the Liouville conformal field theory (CFT) from probabilistic methods, and the formalization of the conformal bootstrap. This model has offered a fruitful playground to unify the…
This paper establishes a novel combinatorial framework at the intersection of Lie theory and algebraic combinatorics, based on a generalization of the Kostant game. We begin by reviewing the foundations of root systems, the classification…
We construct the Weil restriction map for l-adic cohomology and, more generally, for mixed Weil cohomology theories. We study its compatibility with the motivic cycle class map and show that these constructions admit a natural…
When working in Homotopy Type Theory and Univalent Foundations, the traditional role of the category of sets, Set, is replaced by the category hSet of homotopy sets (h-sets); types with h-propositional identity types. Many of the properties…
In this paper we consider the problem of building rich categories of setoids, in standard intensional Martin-L\"of type theory (MLTT), and in particular how to handle the problem of equality on objects in this context. Any…
We introduce type-theoretic algebraic weak factorisation systems and show how they give rise to homotopy-theoretic models of Martin-L\"of type theory. This is done by showing that the comprehension category associated to a type-theoretic…
A criterion for the validity of the Riemann hypothesis reduced the problem to the search for a certain estimate, for a hermitian form associated by means of the Weyl symbolic calculus of operators to a distribution in the plane of an…
We study the constructible Witt theory of \'etale sheaves of $\Lambda$-modules on a scheme $X$ for coefficient rings $\Lambda$ having finite characteristic not equal to 2 and prime to the residue characteristics of the scheme $X$. Our…