Related papers: Weyl's Predicative Classical Mathematics as a Logi…
The work is devoted to Computability Logic (CoL) -- the philosophical/mathematical platform and long-term project for redeveloping classical logic after replacing truth} by computability in its underlying semantics (see…
We formulate a conjecture for the local parts of Weyl group multiple Dirichlet series attached to root systems of type D. Our conjecture is analogous to the description of the local parts of type A series given by Brubaker, Bump, Friedberg,…
A non-classical Weyl theory is developed for Dirac systems with rectangular matrix potentials. The notion of the Weyl function is introduced and the corresponding direct problem is treated. Furthermore, explicit solutions of the direct and…
At the heart of intuitionistic type theory lies an intuitive semantics called the "meaning explanations"; crucially, when meaning explanations are taken as definitive for type theory, the core notion is no longer "proof" but "verification".…
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…
We construct a realizability model of linear dependent type theory from a linear combinatory algebra. Our model motivates a number of additions to the type theory. In particular, we add a universe with two decoding operations: one takes…
We examine the class of languages that can be defined entirely in terms of provability in an extension of the sorted type theory (Ty_n) by embedding the logic of phonologies, without introduction of special types for syntactic entities.…
We study the parametrizations of simple modules provided by the theory of basic sets for all finite Weyl groups. In the case of type B, we show the existence of basic sets for the matrices of constructible representations. Then we study…
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…
Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…
A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…
In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…
The use of logical systems for problem-solving may be as diverse as in proving theorems in mathematics or in figuring out how to meet up with a friend. In either case, the problem solving activity is captured by the search for an…
We show that every distributive lattice-ordered pregroup can be embedded into a functional algebra over an integral chain, thus improving the existing Cayley/Holland-style embedding theorem. We use this to show that the variety of all…
It often happens that free algebras for a given theory satisfy useful reasoning principles that are not preserved under homomorphisms of algebras, and hence need not hold in an arbitrary algebra. For instance, if $M$ is the free monoid on a…
Cubical type theory is an extension of Martin-L\"of type theory recently proposed by Cohen, Coquand, M\"ortberg and the author which allows for direct manipulation of $n$-dimensional cubes and where Voevodsky's Univalence Axiom is provable.…
We construct a Poincare-Birkhoff-Witt type basis for the Weyl modules of the current algebra of $sl_{r+1}$. As a corollary we prove a conjecture made by Chari and Pressley on the dimension of the Weyl modules in this case. Further, we…
A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…
We propose a set theory strong enough to interpret powerful type theories underlying proof assistants such as LEGO and also possibly Coq, which at the same time enables program extraction from its constructive proofs. For this purpose, we…
We construct a family of homomorphisms between Weyl modules for affine Lie algebras in characteristic p, which supports our conjecture on the strong linkage principle in this context. We also exhibit a large class of reducible Weyl modules…