相关论文: The Agda Universal Algebra Library, Part 1: Founda…
A number of models of linear logic are based on or closely related to linear algebra, in the sense that morphisms are "matrices" over appropriate coefficient sets. Examples include models based on coherence spaces, finiteness spaces and…
This paper describes mathlib, a community-driven effort to build a unified library of mathematics formalized in the Lean proof assistant. Among proof assistant libraries, it is distinguished by its dependently typed foundations, focus on…
This book is a continuation of the book n-linear algebra of type I and its applications. Most of the properties that could not be derived or defined for n-linear algebra of type I is made possible in this new structure: n-linear algebra of…
In this paper, we enlarge the language of MTL-algebras by a unary operation $\forall$ equationally described so as to abstract algebraic properties of the universal quantifier "for any" in its original meaning. The resulting class of…
Regular languages -- the languages accepted by deterministic finite automata -- are known to be precisely the languages recognized by finite monoids. This characterization is the origin of algebraic language theory. In this paper, we…
Some advantages of Cubical Type Theory, as implemented by Cubical Agda, over intensional Martin-L\"of Type Theory include Quotient Inductive Types (QITs), which exist as instances of Higher Inductive Types, and functional extensionality,…
This document provides a formal proof of Birkhoff's completeness theorem for multi-sorted algebras which states that any equational entailment valid in all models is also provable in the equational theory. More precisely, if a certain…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
Higher inductive types are inductive types that include nontrivial higher-dimensional structure, represented as identifications that are not reflexivity. While work proceeds on type theories with a computational interpretation of univalence…
Abella is an interactive system for reasoning about aspects of object languages that have been formally presented through recursive rules based on syntactic structure. Abella utilizes a two-level logic approach to specification and…
This paper is the first in a series of three, the aim of which is to lay the foundations of algebraic geometry over the free metabelian Lie algebra $F$. In the current paper we introduce the notion of a metabelian Lie $U$-algebra and…
Existential rules, a.k.a. dependencies in databases, and Datalog+/- in knowledge representation and reasoning recently, are a family of important logical languages widely used in computer science and artificial intelligence. Towards a deep…
The Fundamental Theorem of Algebra can be thought of as a statement about the real numbers as a space, considered as an algebraic set over the real numbers as a field. This paper introduces what it means for an algebraic set or affine…
Global Weyl modules for generalized loop algebras $\lie g\tensor A$, where $\lie g$ is a simple finite dimensional Lie algebra and A is a commutative associative algebra were defined, for any dominant integral weight $\lambda$, by…
In this paper, we introduce and study a class of algebras which we call ada algebras. An artin algebra is ada if every indecomposable projective and every indecomposable injective module lies in the union of the left and the right parts of…
Dependently-typed host languages empower users to verify a wide range of properties of embedded languages and programs written in them. Designers of such embedded languages are faced with a difficult choice between using a shallow or a deep…
Linear typed $\lambda$-calculi are more delicate than their simply typed siblings when it comes to metatheoretic results like preservation of typing under renaming and substitution. Tracking the usage of variables in contexts places more…
In a paper by the authors, the associative and the Lie algebras of Weyl type $A[D]=A\otimes F[D]$ were introduced, where $A$ is a commutative associative algebra with an identity element over a field $F$ of any characteristic, and $F[D]$ is…
A monomial basis and a filtration of subalgebras for the universal enveloping algebra $U(g_l)$ of a complex simple Lie algebra $g_l$ of type $A_l$ is given in this note. In particular, a new multiplicity formula for the Weyl module…
A new algebraic treatment of dependent type theory is proposed using ideas derived from topos theory and algebraic set theory.