Related papers: The Agda Universal Algebra Library, Part 2: Struct…
In this paper I consider locally finite Lie algebras of characteristic zero satisfying the condition that for every finite number of elements $x_{1}, x_{2},..., x_{k}$ of such an algebra $L$ there is finite-dimensional subalgebra $A$ which…
Nested datatypes have been widely studied in the past 25 years, both theoretically using category theory, and practically in programming languages such as Haskell. They consist in recursive polymorphic datatypes where the type parameter…
For efficiency reasons, the software system designers' will is to use an integrated set of methods and tools to describe specifications and designs, and also to perform analyses such as dependability, schedulability and performance. AADL…
We develop a `universal' support theory for derived categories of constructible (analytic or \'etale) sheaves, holonomic D-modules, mixed Hodge modules and others. As applications we classify such objects up to the tensor triangulated…
M. E. Sweedler first constructed a universal Hopf algebra of an algebra. It is known that the dual notions to the existing ones play a dominant role in Hopf algebra theory. Yu. I. Manin and D. Tambara introduced the dual notion of…
We classify the 6-dimensional Lie algebras that can be endowed with an abelian complex structure and parameterize, on each of these algebras, the space of such structures up to holomorphic isomorphism.
We prove two results intended to streamline proofs about cellularity that pass through mutual algebraicity. First, we show that a countable structure $M$ is cellular if and only if $M$ is $\omega$-categorical and mutually algebraic. Second,…
This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete…
Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many applications in computer science, including quantum…
Formal deductive systems are very common in computer science. They are used to represent logics, programming languages, and security systems. Moreover, writing programs that manipulate them and that reason about them is important and…
An alternative proof of the duality of generalized Lie bialgebroid is given and proved a canonical Jacobi structure can be defined on the base of it. We also introduce the notion of morphism between generalized Lie bialgebroids and proved…
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…
We introduce a universal algebraic generalization of de Jongh's notion of dependence for formulas of intuitionistic propositional logic, relating it to a notion of dependence defined by Marczewski for elements of an algebraic structure.…
Theory of representations of universal algebra is a natural development of the theory of universal algebra. Morphism of the representation is the map that conserve the structure of the representation. Exploring of morphisms of the…
Graded modalities have been proposed in recent work on programming languages as a general framework for refining type systems with intensional properties. In particular, continuous endomaps of the discrete time scale, or time warps, can be…
The nonabelian two-dimensional Lie algebra over a field $\mathbb{F}$ has a presentation by generators $A$, $B$ and relation $\left[ A,B\right]=A$, with the universal enveloping algebra having a presentation by generators $A$, $B$ and…
Categorical universal algebra can be developed either using Lawvere theories (single-sorted finite product theories) or using monads, and the category of Lawvere theories is equivalent to the category of finitary monads on Set. We show how…
We show that every higher Auslander algebra $A_{n+1}^d$ of type $\mathbb{A}$ such that $\gcd(n,d)=1$ is derived equivalent to a certain replicated algebra $B=B_0^{(n+d)}$. Moreover ${\rm{gldim}} B = nd$ and $B$ admits an $nd$-cluster…
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…
We classify the 6-dimensional Lie algebras of the form $g\times g$ that admit integrable complex structure. We also endow a Lie algebra of the kind $o(n)\oplus o(n)$ with such a complex structure. The motivation comes from geometric…