Related papers: On the Compatibility of Constructive Predicative M…
We adapt our light Dialectica interpretation to usual and light modal formulas (with universal quantification on boolean and natural variables) and prove it sound for a non-standard modal arithmetic based on Goedel's T and classical S4. The…
Global and local Weyl Modules were introduced via generators and relations in the context of affine Lie algebras in a work by the first author and Pressley and were motivated by representations of quantum affine algebras. A more general…
Tennenbaum's theorem states that the only countable model of Peano arithmetic (PA) with computable arithmetical operations is the standard model of natural numbers. In this paper, we use constructive type theory as a framework to revisit,…
In this paper we will develop an axiomatic foundation for the geometric study of straight edge, protractor, and compass constructions, which while being related to previous foundations, will be the first to have all axioms written and all…
Within dependent type theory, we provide a topological counterpart of well-founded trees (for short, W-types) by using a proof-relevant version of the notion of inductively generated suplattices introduced in the context of formal topology…
This article presents the concept of material interpretation as a method to transform classical proofs into constructive ones. Using the case study of maximal ideals in $\mathbb{Z}[X]$, it demonstrates how a classical implication $A \to B$…
We give a proof of the inconsistency of PM arithmetic, classical set theory and related systems, incidentally exposing an error in Goedel's own proof of Goedel's Theorems. The inconsistency proof, that formulae of the form R and ~R occur as…
As Weyl was interested in infinitesimal analysis and for some years embraced Brouwer's intuitionism, which he continued to see as an ideal even after he had convinced himself that it is a practical necessity for science to go beyond…
The seminal paper "J.T. Stafford, Module structure of Weyl algebras, J. London Math. Soc. (2) 18 (1978), no. 3, 429--442" was a major step forward in our understanding of Weyl algebras. Beginning with Serre's Theorem on free summands of…
In this work we shall introduce a new model structure on the category of pro-simplicial sheaves, which is very convenient for the study of \'etale homotopy. Using this model structure we define a pro-space associated to a topos, as a result…
It is well known that ZFC, despite its usefulness as a foundational theory for mathematics, has two unwanted features: it cannot be written down explicitly due to its infinitely many axioms, and it has a countable model due to the…
Drawing on set theory, this paper contributes to a deeper understanding of the structural condition of mathematical finance under Knightian uncertainty. We adopt a projective framework in which all components of the model -- prices, priors…
Goedel's functional "Dialectica" interpretation can be used to extract functional programs from non-constructive proofs in arithmetic by employing two sorts of higher-order witnessing terms: positive realisers and negative counterexamples.…
Natural philosophy integrates scientific observation with abstract frameworks, often using a mathematical Ansatz to hypothesise about physical phenomena. Exploring the possibility of other universes, however, challenges assumptions that…
We study a conservative extension of classical propositional logic distinguishing between four modes of statement: a proposition may be affirmed or denied, and it may be strong or classical. Proofs of strong propositions must be…
We develop a constructive theory of continuous domains from the perspective of program extraction. Our goal that programs represent (provably correct) computation without witnesses of correctness is achieved by formulating correctness…
We show that except in several cases conjugacy classes of classical Weyl groups $W(B_n)$ and $W(D_n)$ are of type {\rm D}. We prove that except in three cases Nichols algebras of irreducible Yetter-Drinfeld ({\rm YD} in short )modules over…
In this dissertation we provide mathematical evidence that the concept of learning can be used to give a new and intuitive computational semantics of classical proofs in various fragments of Predicative Arithmetic. First, we extend Kreisel…
This article presents a computational semantics for classical logic using constructive type theory. Such semantics seems impossible because classical logic allows the Law of Excluded Middle (LEM), not accepted in constructive logic since it…
We define a Weil-\'etale complex with compact support for duals (in the sense of the Bloch dualizing cycles complex $\mathbb{Z}^c$) of a large class of $\mathbb{Z}$-constructible sheaves on an integral $1$-dimensional proper arithmetic…