English
Related papers

Related papers: Nominal Coalgebraic Data Types with Applications t…

200 papers

An Artin algebra $\Lambda$ is said to be of finite Cohen-Macaulay type, $\rm{CM}$-finite for short, if the full subcategory $\rm{Gprj}\mbox{-} \Lambda$ of finitely generated Gorenstein projective $\Lambda$-modules is of finite…

Representation Theory · Mathematics 2019-02-21 Rasool Hafezi

The graded Lie algebra associated with the Nottingham group over a field of prime characteristic serves as a fundamental example of Nottingham algebras, a class of infinite-dimensional, positively graded thin algebras. This paper completes…

Rings and Algebras · Mathematics 2026-03-05 M. Avitabile , A. Caranti , S. Mattarei

The infinitary lambda calculi pioneered by Kennaway et al. extend the basic lambda calculus by metric completion to infinite terms and reductions. Depending on the chosen metric, the resulting infinitary calculi exhibit different notions of…

Logic in Computer Science · Computer Science 2018-05-18 Patrick Bahr

We define an equivalence relation on propositions and a proof system where equivalent propositions have the same proofs. The system obtained this way resembles several known non-deterministic and algebraic lambda-calculi.

Logic in Computer Science · Computer Science 2013-04-01 Alejandro Díaz-Caro , Gilles Dowek

We introduce the notion of ends for algebras. The definition is analogous to the one in geometric group theory. We establish some relations to growth conditions and cyclic cohomology.

Rings and Algebras · Mathematics 2007-05-23 Gabor Elek , Aryeh Y. Samet-Vaillant

computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…

Logic in Computer Science · Computer Science 2007-05-23 J. V. Tucker , J. I. Zucker

This paper provides a coalgebraic approach to the language semantics of two types of non-deterministic automata over nominal sets: non-deterministic orbit-finite automata (NOFAs) and regular nominal non-deterministic automata (RNNAs), which…

Logic in Computer Science · Computer Science 2022-03-30 Florian Frank , Stefan Milius , Henning Urbat

Finite versions of W-algebras are introduced by considering (symplectic) reductions of finite dimensional simple Lie algebras. In particular a finite analogue of $W^{(2)}_3$ is introduced and studied in detail. Its unitary and non-unitary,…

High Energy Physics - Theory · Physics 2009-10-22 T. Tjin

We provide a complete classification of the singularities of cluster algebras of finite cluster type. This extends our previous work about the case of trivial coefficients. Additionally, we classify the singularities of cluster algebras for…

Algebraic Geometry · Mathematics 2025-09-23 Angélica Benito , Eleonore Faber , Hussein Mourtada , Bernd Schober

We provide a proof of strong normalisation for lambda+, a recently introduced, explicitly typed, non-deterministic lambda-calculus where isomorphic propositions are identified. Such a proof is a non-trivial adaptation of the reducibility…

Logic in Computer Science · Computer Science 2014-01-09 Alejandro Díaz-Caro , Gilles Dowek

We find all finite Ockham algebras that admit only finitely many compatible relations (modulo a natural equivalence). Up to isomorphism and symmetry, these Ockham algebras form two countably infinite families: one family consists of the…

Rings and Algebras · Mathematics 2015-01-13 Brian A. Davey , Long T. Nguyen , Jane G. Pitkethly

Recent developments in the categorical foundations of universal algebra have given fresh impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott's…

Category Theory · Mathematics 2015-07-22 Martin Hyland

Computation of polynomial relative invariants is a classical tool in algebra. Relative differential invariants are central for the equivalence problem of geometric structures. We address the fundamental problem of finite generation of their…

Differential Geometry · Mathematics 2026-05-19 Boris Kruglikov , Eivind Schneider

We study locally finite varieties (=primitive classes) of linear algebras over finite fields. We do not assume that our algebras are associative or Lie. We are interested in the basic properties of finite algebras in these varieties such…

Rings and Algebras · Mathematics 2026-03-11 Yuri Bahturin , Alexander Olshanskii

In this paper we define infinite-dimensional algebra and its representation, whose basis is naturally identified with semi-infinite configurations of the square ladder model. We also extrapolate the ideas for the cyclic 3-leg triangular…

Combinatorics · Mathematics 2022-06-14 Valerii Sopin

For finitary regular monads T on locally finitely presentable categories we characterize the finitely presentable objects in the category of T-algebras in the style known from general algebra: they are precisely the algebras presentable by…

Category Theory · Mathematics 2019-09-06 Jiří Adámek , Stefan Milius , Lurdes Sousa , Thorsten Wißmann

We define a new class of infinitary logics $\mathscr L^1_{\kappa,\alpha}$ generalizing Shelah's logic $\mathbb L^1_\kappa$ defined in \cite{MR2869022}. If $\kappa=\beth_\kappa$ and $\alpha <\kappa$ is infinite then our logic coincides with…

Logic · Mathematics 2024-02-22 Jouko Vaananen , Boban Velickovic

The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while…

Logic in Computer Science · Computer Science 2012-03-29 Pablo Buiras , Alejandro Díaz-Caro , Mauro Jaskelioff

We consider a class of infinite-dimensional, modular, graded Lie algebras, which includes the graded Lie algebra associated to the Nottingham group with respect to its lower central series. We identify two subclasses of Nottingham Lie…

Rings and Algebras · Mathematics 2013-12-06 Marina Avitabile , Sandro Mattarei

Boolean-type algebra (BTA) is investigated. A BTA is decomposed into Boolean-type lattice (BTL) and a complementation algebra (CA). When the object set is finite, the matrix expressions of BTL and CA (and then BTA) are presented. The…

Logic · Mathematics 2019-09-17 Daizhan Cheng , Jun-e Feng , Jianli Zhao , Shihua Fu