English
Related papers

Related papers: For Generalised Algebraic Theories, Two Sorts Are …

200 papers

The aim of this paper is to study categorified algebraic structures and their pseudo- and lax homomorphisms using the framework of Lawvere $2$-theories, and more generally, (enhanced) $2$-dimensional sketches. The key notion we focus on is…

Category Theory · Mathematics 2026-02-17 Tomáš Perutka

This paper proposes a formal cognitive framework for problem solving based on category theory. We introduce cognitive categories, which are categories with exactly one morphism between any two objects. Objects in these categories are…

Artificial Intelligence · Computer Science 2017-09-15 Francisco J. Arjonilla , Tetsuya Ogata

We name an indecomposable symmetrizable generalized Cartan matrix $A$ and the corresponding Kac--Moody Lie algebra ${\goth g} ^\prime (A)$ {\it of the arithmetic type} if for any $\beta \in Q$ with $(\beta | \beta)<0$ there exist $n(\beta…

alg-geom · Mathematics 2008-02-03 Viacheslav V. Nikulin

We study the topos of sets equipped with an action of the monoid of regular $2 \times 2$ matrices over the integers. In particular, we show that the topos-theoretic points are given by the double quotient $\left. GL_2(\hat{\mathbb{Z}})…

Algebraic Geometry · Mathematics 2019-08-07 Jens Hemelaer

It is commonly believed that algebraic notions of type theory support only universes \`a la Tarski, and that universes \`a la Russell must be removed by elaboration. We clarify the state of affairs, recalling the details of Cartmell's…

Logic in Computer Science · Computer Science 2019-02-26 Jonathan Sterling

Given an algebraic torus action on a normal projective variety with finitely generated total coordinate ring, we study the GIT-equivalence for not necessarily ample linearized divisors, and we provide a combinatorial description of the…

Algebraic Geometry · Mathematics 2007-05-23 Florian Berchtold , Juergen Hausen

A hierarchy of type universes is a rudimentary ingredient in the type theories of many proof assistants to prevent the logical inconsistency resulting from combining dependent functions and the type-in-type rule. In this work, we argue that…

Programming Languages · Computer Science 2024-04-09 Jonathan Chan , Stephanie Weirich

The introduction of first-class type classes in the Coq system calls for re-examination of the basic interfaces used for mathematical formalization in type theory. We present a new set of type classes for mathematics and take full advantage…

Logic in Computer Science · Computer Science 2011-02-08 Bas Spitters , Eelis van der Weegen

A differential category is an additive symmetric monoidal category, that is, a symmetric monoidal category enriched over commutative monoids, with an algebra modality, axiomatizing smooth functions, and a deriving transformation on this…

Category Theory · Mathematics 2025-10-08 Jean-Baptiste Vienney

Homotopy type theory (HoTT) can be seen as a generalisation of structural set theory, in the sense that 0-types represent structural sets within the more general notion of types. For material set theory, we also have concrete models as…

Logic · Mathematics 2025-10-31 Håkon Robbestad Gylterud , Elisabeth Stenholm

We give a definition of an operad with general groups of equivariance suitable for use in any symmetric monoidal category with appropriate colimits. We then apply this notion to study the 2-category of algebras over an operad in Cat. We…

Category Theory · Mathematics 2014-02-28 Alexander S. Corner , Nick Gurski

We present our library for Universal Algebra in the UniMath framework dealing with multi-sorted signatures, their algebras, and the basics for equation systems. We show how to implement term algebras over a signature without resorting to…

Logic in Computer Science · Computer Science 2025-02-12 Gianluca Amato , Matteo Calosci , Marco Maggesi , Cosimo Perini Brogi

The q-generalizations of the two fundamental statements of matrix algebra -- the Cayley-Hamilton theorem and the Newton relations -- to the cases of quantum matrix algebras of an "RTT-" and of a "Reflection equation" types have been…

Quantum Algebra · Mathematics 2009-10-31 A. Isaev , O. Ogievetsky , P. Pyatov

GADTs were introduced in Haskell's eco-system more than a decade ago, but their interaction with several mainstream features such as type classes and functional dependencies has a lot of room for improvement. More specifically, for some…

Programming Languages · Computer Science 2019-07-02 Koen Pauwels , Georgios Karachalias , Michiel Derhaeg , Tom Schrijvers

We prove that Kitaev's lattice model for a finite-dimensional semisimple Hopf algebra H is equivalent to the combinatorial quantisation of Chern-Simons theory for the Drinfeld double D(H). This shows that Kitaev models are a special case of…

Quantum Algebra · Mathematics 2017-06-27 Catherine Meusburger

Following ideas of Lawvere and Linton we prove that classical varieties are precisely the exact categories with a varietal generator. This means a strong generator which is abstractly finite and regularly projective. An analogous…

Category Theory · Mathematics 2024-02-23 Jiri Adamek

We introduce a new framework called linear algebraic number theory (LANT) that reformulates the number-theoretic problem as a regression model and solves it using matrix algebra. This framework restricts all computations to log space,…

General Mathematics · Mathematics 2017-09-19 Joram Soch

Elie Cartan's general equivalence problem is recast in the language of Lie algebroids. The resulting formalism, being coordinate and model-free, allows for a full geometric interpretation of Cartan's method of equivalence via reduction and…

Differential Geometry · Mathematics 2012-03-07 Anthony D. Blaom

Meta-learning has emerged as a trending technique to tackle few-shot text classification and achieve state-of-the-art performance. However, the performance of existing approaches heavily depends on the inter-class variance of the support…

Computation and Language · Computer Science 2023-06-12 Shuo Lei , Xuchao Zhang , Jianfeng He , Fanglan Chen , Chang-Tien Lu

Denotational semantics can be based on algebras with additional structure (order, metric, etc.) which makes it possible to interpret recursive specifications. It was the idea of Elgot to base denotational semantics on iterative theories…

Logic in Computer Science · Computer Science 2017-01-11 Jiri Adamek , Stefan Milius , Jiri Velebil
‹ Prev 1 3 4 5 6 7 10 Next ›