English
Related papers

Related papers: The Agda Universal Algebra Library, Part 1: Founda…

200 papers

Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and their proofs. Such calculi can also be given a logic…

Logic in Computer Science · Computer Science 2010-05-25 Zachary Snow , David Baelde , Gopalan Nadathur

This paper introduces an expressive class of quotient-inductive types, called QW-types. We show that in dependent type theory with uniqueness of identity proofs, even the infinitary case of QW-types can be encoded using the combination of…

Logic in Computer Science · Computer Science 2022-03-15 Marcelo Fiore , Andrew M. Pitts , S. C. Steenkamp

This paper studies algebras arising as algebraic semantics for logics used to model reasoning with incomplete or inconsistent information. In particular we study, in a uniform way, varieties of bilattices equipped with additional…

Rings and Algebras · Mathematics 2015-03-25 L. M. Cabrer , H. A. Priestley

It is shown that universal algebras that are injective in their equational classes are characterized by internal property that can be called completeness. We define universal algebra $A$ as complete (closed to simple extensions) if for each…

Commutative Algebra · Mathematics 2021-12-14 Pavlo Dzikovskyi

This paper explores proof-theoretic aspects of hybrid type-logical grammars , a logic combining Lambek grammars with lambda grammars. We prove some basic properties of the calculus, such as normalisation and the subformula property and also…

Computation and Language · Computer Science 2020-09-23 Richard Moot , Symon Stevens-Guille

In this paper we prove that in prime characteristic there is a functor $-_{p-Leib}$ from the category of diassociative algebras to the category of restricted Leibniz algebras, generalizing the functor from associative algebras to restricted…

Rings and Algebras · Mathematics 2007-06-13 Ioannis Dokas , Jean-Louis Loday

The term UniMath refers both to a formal system for mathematics, as well as a computer-checked library of mathematics formalized in that system. The UniMath system is a core dependent type theory, augmented by the univalence axiom. The…

Logic in Computer Science · Computer Science 2019-07-16 Benedikt Ahrens , Ralph Matthes , Anders Mörtberg

We consider some special type extensions of an arbitrary Lie algebra, which we call universal extensions. We show that these extensions are in one-to-one correspondence with finite dimensional associative commutative algebras. We also…

Rings and Algebras · Mathematics 2007-05-23 A B Yanovski

This paper presents COREALMLIB, an ALM library of commonsense knowledge about dynamic domains. The library was obtained by translating part of the COMPONENT LIBRARY (CLIB) into the modular action language ALM. CLIB consists of general…

Artificial Intelligence · Computer Science 2016-08-15 Daniela Inclezan

We develop formal theories of conversion for Church-style lambda-terms with Pi-types in first-order syntax using one-sorted variables names and Stoughton's multiple substitutions. We then formalize the Pure Type Systems along some…

Logic in Computer Science · Computer Science 2025-10-15 Sebastián Urciuoli

The Abella interactive theorem prover has proven to be an effective vehicle for reasoning about relational specifications. However, the system has a limitation that arises from the fact that it is based on a simply typed logic:…

Logic in Computer Science · Computer Science 2018-06-21 Gopalan Nadathur , Yuting Wang

Algebraic logic studies algebraic theories related to proposition and first-order logic. A new algebraic approach to first-order logic is sketched in this paper. We introduce the notion of a quantifier theory, which is a functor from the…

Logic in Computer Science · Computer Science 2013-01-07 Zhaohua Luo

We present a framework for the formal meta-theory of lambda calculi in first-order syntax, with two sorts of names, one to represent both free and bound variables, and the other for constants, and by using Stoughton's multiple…

Logic in Computer Science · Computer Science 2023-03-24 Sebastián Urciuoli

As the development of formal proofs is a time-consuming task, it is important to devise ways of sharing the already written proofs to prevent wasting time redoing them. One of the challenges in this domain is to translate proofs written in…

Logic in Computer Science · Computer Science 2024-09-18 Thiago Felicissimo , Frédéric Blanqui

We define a general class of dependent type theories, encompassing Martin-L\"of's intuitionistic type theories and variants and extensions. The primary aim is pragmatic: to unify and organise their study, allowing results and constructions…

Logic · Mathematics 2020-09-14 Andrej Bauer , Philipp G. Haselwarter , Peter LeFanu Lumsdaine

Following the classical approach of Birkhoff, we suggest an enriched version of enriched universal algebra. Given a suitable base of enrichment $\mathcal V$, we define a language $\mathbb L$ to be a collection of $(X,Y)$-ary function…

Category Theory · Mathematics 2026-03-04 Jiří Rosický , Giacomo Tendas

The main purpose of this article is to develop an explicit derived deformation theory of algebraic structures at a high level of generality, encompassing in a common framework various kinds of algebras (associative, commutative, Poisson...)…

Algebraic Topology · Mathematics 2025-03-11 Gregory Ginot , Sinan Yalin

Let $\mathfrak{g}$ be a finite dimensional complex simple classical Lie superalgebra and $A$ be a commutative, associative algebra with unity over $\mathbb{C}$. In this paper we define an integral form for the universal enveloping algebra…

Representation Theory · Mathematics 2015-05-28 Irfan Bagci , Samuel Chamberlin

This paper explores formalizing Geometric (or Clifford) algebras into the Lean 3 theorem prover, building upon the substantial body of work that is the Lean mathematics library, mathlib. As we use Lean source code to demonstrate many of our…

Logic in Computer Science · Computer Science 2022-04-20 Eric Wieser , Utensil Song

This text is devoted to the theory of varieties, which provides an important tool, based in universal algebra, for the classification of regular languages. In the introductory section, we present a number of examples that illustrate and…

Formal Languages and Automata Theory · Computer Science 2021-11-19 Howard Straubing , Pascal Weil
‹ Prev 1 4 5 6 7 8 10 Next ›